Lovino - B5 - GED102 - Week 3 - WGN3
Uploaded by
Julia LovinoLovino - B5 - GED102 - Week 3 - WGN3
Uploaded by
Julia LovinoGuided
Noteboo
k in
GED10 Task List
Week 3 less
2 mathematical language. It covers propositional
logic, which entails evaluation of truth values of
simple and compound propositions and statements.
Predicate logic is also discussed where evaluation of
(Mathe
quantified statements in terms of their truth values
is also discussed.
matics
Keep track of your progress in this lesson by
checking the box corresponding to each task.
_____ 1. Read/Watch Module 1 Lesson 7 Lecture
in the _____ 2. Read/Watch Module 1 Lesson 8 Lecture
Modern
World)
3RD QUARTER, SY2022 - 2023 GED 102 WEEK 3
_____ 3. Answer HW in Blackboard.
_____ 4. Prepare for/take Module 1 Quiz
_____ 5. Finalize and submit Module 1 Project.
_____ 6. Prepare and submit the documentation of project.
_____ 7. Submit WGN Week 3.
Lesson 7. Propositional Logic
Highlights
1. What are the five types of compound statements/propositions?
I. Negation
II. Disjunction
III. Conjunction
IV. Conditional
V. Biconditional
3RD QUARTER, SY2022 - 2023 GED 102 WEEK 3
A. Given the conditional proposition p → q . Write the symbolic form of the
following related propositions:
1. Negation - ~𝑝
2. Converse - 𝑞 → 𝑝
3. Inverse - ~𝑝 → ~𝑞
4. Contrapositive - ~𝑞 → ~𝑝
B. Define a tautology, a contradiction and a contingency.
1. Tautology – remark made by both parties that is both accurate and does not take
the truth values into consideration.
2. Contradiction – A statement that is invariably dishonest, and the values of the truth
are not taken into consideration.
3. Contingency – jointly stated position that does not contain a tautology or a
contradiction.
Lesson 8. Predicate Logic
Highlights
A. Define and give 2 examples of universal quantification.
“all”; “every”
If S is a set and P(x) is a statement wherein it is about the elements of x then the
expression should be “(∀𝑥 ∈ 𝑆)𝑃(𝑥))” which means that “all x in S is true” and “ the
every x in S is true in P(x).
Example:
“All High school students are sleep deprived.”
“Every person has its’ own set of capabilities.”
3RD QUARTER, SY2022 - 2023 GED 102 WEEK 3
B. Define and give 2 examples of existential quantification.
“some”; “there exists”
If S is a set and P(x) is a statement wherein it is about the elements of x then the
expression should be “(∃𝑥 ∈ 𝑆)𝑃(𝑥)”) which means that “x there exist in S in which
P(x) is true” or “At least there is one x in S which P(x) is true for”.
Example:
“Some students prefer studying at night than morning.”
“Some women prefer matte lipsticks than lip gloss.”
C. Explain how to negate a universal and existential quantification. Give 2
examples of each.
In order to negate a universal and existential quantification, simply negate the
idea for “every” or “all” while for existential negate the idea for “every” or “least”
Example:
Universal:
1. “All call center agent are coffee lovers.”
“Not all call center agent are coffee lovers.”
2. “Every person is unique.”
3. “Not every person is unique.”
Existential:
1. “At least each person has experienced being embarrassed.”
“No person has experienced being embarrassed.”
2. “Some people prefer tea over coffee.”
“There no people that prefer tea over coffee.”