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.

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)
FIRST 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?

1. Negation- Reverses and flips the truth value of the statement, its words are
“not” and “it isn’t true that”. Denoted by the symbol tilde or “~”.

2. Disjunction- Disjunction is formed when it is used by a connective such as “or”

implicated with the keywords of “Either-or” and denoted with “V”

3. Conjunction- Conjunction is formed when it used the connecting “and”

its keywords are “and”, “although”, and “but”, etc. it is denoted with the symbol
“^”
FIRST QUARTER, SY2020-2021 GED 102 WEEK 3

4. Conditional- Conditional is a statement whose foundation is an “if-then” and it is

constructed like a hypothesis, its other name is called implication. It is denoted
with the symbol “→”.

5. Biconditional- Biconditional is the other version of the conditional statement, or it

is the double conditional statement, it uses the connective keyword “if and only if”.
And it is denoted by the symbol “↔”.

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

following related propositions:
1. Negation
p→q
2. Converse
q→p
3. Inverse
~p → ~q
4. Contrapositive
~q → ~p

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

a. Tautology - a group of statements that, regardless of the component's true

values claims, are true at all times.
b. Contradiction - No matter what the component statements' truth values are,
always false.
c. Contingency - a composite assertion that neither fits into a phrase nor a
clause, neither contradicts itself nor is a tautology.
FIRST QUARTER, SY2020-2021 GED 102 WEEK 3

Lesson 8. Predicate Logic

Highlights

A. Define and give 2 examples of universal quantification.

B. Define and give 2 examples of existential quantification.

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

examples of each.