Guided

Noteboo
k in
GED10
Task List
2
W e e k 3 l e s s o n
language. It covers propositional logic, which entails

(Mathe evaluation of truth values of simple and compound

propositions and statements. Predicate logic is also
discussed where evaluation of 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. 5
POINTS

✓ in the 1. Read/Watch Module 1 Lesson 7 Lecture

✓ Modern 2. Read/Watch Module 1 Lesson 8 Lecture

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 type of compound statements/propositions? 5 POINTS

Negation – reverses the truth value of the statement

Conjunction – formed using the connective “and”
Disjunction – formed using the connective “or”
Conditional – formed using the connective “if then”
Biconditional – formed using the connective “if and only if”

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

following related propositions: 8 POINTS
4TH QUARTER, SY2020-2021 GED 102 WEEK 3

1. Negation - p^q

2. Converse - ~𝑞 → 𝑝

3. Inverse - ~𝑝 → 𝑞

4. Contrapositive - 𝑞 → ~ 𝑝

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

Tautology – a proposition that is always true

Contradiction – a proposition that is always false
Contingency – a proposition that is neither a tautology or contradiction

Lesson 8. Predicate Logic

Highlights

A. Define and give 2 examples of universal quantification. 8 POINTS

It is a logical constant and a type of quantifier interpreted as “for all” or “for
any”.
Examples:
1. All cars have wheels. ∀x 𝐶(𝑥) → 𝑃(𝑥). Wherein C(x) means x is a car and P(x)
means x has wheels.
2. All dogs are blue. ∀x 𝐷(𝑥) → 𝐵(𝑥) .Wherein D(x) means x is a dog and B(x)
means x is blue.

B. Define and give 2 examples of existential quantification. 8 POINTS

It is a logical constant and a type of quantifier interpreted as “there exist” or “for

4TH QUARTER, SY2020-2021 GED 102 WEEK 3

some”.
Examples:
1. Some trees are big. ∃x 𝑇(𝑥) ^ 𝐵(𝑥) .Wherein T(x) means x is a tree and B(x)
means x is big.
2. Some houses a yellow. ∃x 𝐻(𝑥) ^ 𝑌(𝑥) . Wherein H(x) means x is a house and
Y(x) means x is yellow.

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

examples of each. 9 POINTS

The universal quantifier can be expressed as:

∀x P(x) = P(1) ^ P(2)^ P(3)…..^P(n)

As such, negating it will result in the following:

~(∀ P(x)) = ~(P(1) ^ P(2) ^ P(3)….. ^ P(n))

~ ∀ P(x) = ~P(1) v ~P(2) v ~P(3)….. v ~ P(n)
~ ∀ P(x) = ∃( ~P(x))

Examples:
1. Not all cars have wheels. ~(∀x 𝐶(𝑥) → 𝑃(𝑥)).
~(∀x 𝐶(𝑥) → 𝑃(𝑥)) = ∃( C(x) ^ ~P(x))
Which translates to: Some cars does not have wheels.
2. Not all dogs are blue. ~(∀x 𝐷(𝑥) → 𝐵(𝑥)).
~(∀x 𝐶(𝑥) → 𝑃(𝑥)) = ∃( D(x) ^ ~B(x))
Which translates to : Some dogs are not to blue.
On the other hand, the existential quantifier can be expressed as:
∃x P(x)= P(1) v P(2) v P(3) …. v P(n)
As such negating it and applying De Morgan’s Law would result in the
following:
~(∃x P(x))=~( P(1) v P(2) v P(3) …. v P(n))
~∃x P(x)= ~P(1) ^ ~P(2) ^ ~ P(3) …. ^ ~ P(n)
~∃x P(x)= ∀x (~P(x))
4TH QUARTER, SY2020-2021 GED 102 WEEK 3

Examples:
1. It is not true that some trees are big. ~(∃x 𝑇(𝑥) ^ 𝐵(𝑥) ).
~( ∃x 𝑇(𝑥) ^ 𝐵(𝑥))= ∀x(T(x) v ~B(x))
Which translates to : All trees are not big.
2. It is not true that some houses a yellow. ~(∃x 𝐻(𝑥) ^ 𝑌(𝑥) ).
~( ∃x 𝐻(𝑥) ^ 𝑌(𝑥) .)= ∀x(H(x) ^ ~Y(x))
Which translates to: All houses are not yellow.