Guided

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.

Keep track of your progress in this lesson by

matics 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)
4TH QUARTER, SY2020-2021 GED 102
WEEK 3

_____ 3. Answer HW3 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

A. What are the five types of compound statements/propositions?

a. Negation – A negation reverses the truth value of a statement. It uses
the symbol: ~.
b. Disjunction – A disjunction is formed by using the connective “or”. It
uses the symbol: p V q.
c. Conjunction – A conjunction is formed by using the connective “and”. It
uses the symbol: p ∧ q.
d. Conditional – A conditional statement is formed by using the connective
“if-then”. In its fundamental form as “If 𝑝, then 𝑞”, p is called the
antecedent while q is called the consequent. A conditional statement is
also called an implication. It uses the symbol: p → q.
4TH QUARTER, SY2020-2021 GED 102
WEEK 3

e. Biconditional - A biconditional is formed by using the connective “if and

only if”. It is also called a double conditional. It uses the symbol: 𝑝 ↔ q.

B. Given the conditional proposition p → q . Write the symbolic form of the

following related propositions:
1. Negation - ~𝑝

2. Converse – 𝑞 →𝑝

3. Inverse - ~𝑝 → ~𝑞

4. Contrapositive - ~𝑞 → ~𝑝

C. Define a tautology, a contradiction and a contingency.

A tautology is a compound statement that is always true regardless of the
truth values of the component statements while a contradiction is always false
regardless of the truth values of component statements. Finally, contingency is a
compound statement that is neither a tautology nor a contradiction.

Lesson 8. Predicate Logic

Highlights

A. Define and give 2 examples of universal quantification.

Definition:
- “all”; “every”
- If S is a set and P(x) is a statement about the element x, then the expression
(∀𝑥𝜖s) P(x) means “For all x in S, P(x) is true” or “P(x) is true for every x in S”.

Example:
1. “Every person has its’ own set of capabilities.”
2. “All motorcycles have wheels”
4TH QUARTER, SY2020-2021 GED 102
WEEK 3

B. Define and give 2 examples of existential quantification.

Definition:
- “some”; “there exists”
- If S is a set and P(x) is a statement about the element x, then the expression
(∃𝑥𝜖𝑆) 𝑃(𝑥) means “There exists x in S for which P(x) is true” or “There is at
least one x in S for which P(x) is true for”.

Example:
1. “Some students prefer studying at night than morning.”
2. “Some women prefer matte lipsticks than lip gloss.”

C. Explain how to negate a universal and existential quantification. Give 2

examples of each.

Negating universal and existential quantification simply uses the negating sign.

Examples:

Universal:
1. “All college students are coffee lovers.”
“Not all college students are coffee lovers.”
2. “Every person is unique.”
“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.”
“No person prefer tea over coffee.”