Logic Math

Lesson 36-41
Lesson Outline:

1. Propositions
2. Logical Operators
3. Truth Table
4. Logical Equivalence
5. Valid Arguments and Fallacies
I. Propositions

Proposition is a declarative sentence that is either true or false, but not both. If a
proposition is true, then its truth value is true, which is denoted by T; otherwise its
truth value is false, which is denoted by F.
Types of Propositions:

1. Simple
Propositions – a proposition that can not be broken
down any further into component propositions

2. Compound Propositions – a proposition formed from a

simpler proposition using logical connectors or some
combination of logical connectors
Examples:

1. Identify whether the following sentence is a proposition or not.

a. Mindanao is an island in the Philippines

b. Find a number which divides your age.
c. My seatmate will get a perfect score in the logic exam.
d. 3+2=5
Examples:
Determine the type of propositions. If it is a compound proposition, identify the
simple components.
II. Logical Operators

1. Negation – is denoted by not p and is defined through its truth table.

Logical Operators
2. Conjunction – is denoted by ^ and is defined through its truth table
Logical Operators

3. Disjunction – is denoted by V and is defined through its truth table

Logical Operators
4. Conditional – is denoted by p → q: (If p, then q); and is
defined through its truth table: The proposition p is called the
hypothesis, while the proposition q is called the conclusion
Logical Operators
5.Biconditional – is denoted by p q: (p if and
only if q); and is defined through its truth table:
III. Truth Table:

Constructing a Truth Table:

1. List all the possible combinations.

2. Determine the possible outcome of each proposition by
performing each logical operator.
3. Determine the final result or outcome of the proposition.
Possible Combinations:
Examples:

1. Let p and q be propositions. Construct the truth table of the compound

propositions:

a. (p q) ^ (q p)
b. P v (p^q)
c. (pvq)^p
Truth Table:

1. Tautolology – a proposition that is always true and is denoted by τ

2. Contradiction – a proposition that is always false and is denoted by Φ

Examples: Construct the truth table of the compound propositions

a. PvT
b. P^Φ
IV. Logical Equivalence

1. Logical Equivalence – two propositions having the same truth values for all
possible truth values of their simple components.

Example:
Table of Logical Equivalence:
V. Valid Arguments

1. Arguments – a compound proposition of the form (p1^p2^….pn) q

2. Fallacy – an argument (p1^p2^…^pn) q

Table of Fallacies: