Republic of the Philippines

Division of Davao City

TOYOZU TECHNICAL SCHOOL FOUNDATION INC.
#25 Dacudao Avenue Agdao, Davao City

GENERAL
MATHEMATICS
SENIOR HIGH SCHOOL
(Grade 11 - Second Quarter)
WEEK 5
(January 18, 2021 – January 22, 2021)

MODULE 5
S.Y. 2020 - 2021
General Mathematics
Lesson 20: Truth Tables

Content Standard
The learner demonstrates understanding of key concepts of propositional logic;
syllogisms and fallacies

Learning Competency
The learner should able to judiciously apply logic in real-life arguments.

Specific Learning Outcomes

At the end of this lesson, the learners will be able to:
1. Determine the truth values of propositions.

ABSTRACTION

Types of Statements and their Connective Symbols

Connective Symbol Type of Statement
and ^ Conjunction
Or v Disjunction
Not ~ Negation
If…then => Conditional
If and only if (iff)  Biconditional

Connectives in their dominant order:

1. Biconditional ()
2. Conditional (=>)
3. Conjunction (^)
4. Disjunction (v)
5. Negation (~)

Conjunctions

The connective and implies the idea of “both”. For the conjunction p ^ q to be true,
both p and q must be true. All the four possible combinations of truth values for the
conjunction p and q are summarized by a table called a truth table.

Table 1
Truth Table for the Conjunction P and Q (P ^ Q)
P Q P^Q
T T T
T F F
F T F
F F F
 The table answers the question, “When is a conjunction true?” For the conjunction to
be true, both P and Q must be true.

Example 1: Let p represent “7>5” and let q represent “12<0”. Find the truth value of p and q.

Solution:
 The statement 7>5 is true. Hence, p is true.
 The statement 12<0 is false. Hence, q is false.

The second row of the conjunction truth table shows that p ^ q is false.
P Q P^Q
T T T
T F F  p is true and q is false.
F T F
F F F

Disjunctions

If Rowan says that he has been reading or writing, then he is telling the truth if he has
been reading and not writing. Likewise, he is telling the truth when he has been writing and
not reading. Also, he is telling the truth when he has been reading and also writing. Table 2
shows the truth table for disjunction. The use of or in this case is called the inclusive or
(inclusive disjunction).

Table 2
Truth table for the Inclusive Disjunction P or Q (P v Q)
P Q PvQ
T T T
T F T
F T T
F F F

Example 2:
Let p be “I will clean the kitchen”.
Let q be “I will clean the bathroom”.
Form the inclusive disjunction of p and q and discuss its truth values.

Solution:
The statement, “I will clean the kitchen or I will clean the bathroom” is the required
disjunction. It will be false only if both components are false and will be true otherwise. (See
Table 2)

Example 3:
Let p be “I will pass the math quiz”.
Let q be “I will flunk the math quiz”.
Form the disjunction of p and q and discuss its truth values.

Solution:
“I will pass the math quiz or I will flunk it” is the desired disjunction. The statement will
only be true when exactly one of the two components is true. Otherwise, it will be false.
When this is the case, we shall refer to the or used as the exclusive or or the exclusive
disjunction. Its truth table is given in Table 3.
Exclusive disjunction is true when one component is true and the other is false.

Table 3
Truth Table for the Exclusive Disjunction P or Q. (P v Q)
P Q PvQ
T T F
T F T
F T T
F F F

Unless otherwise meant or stated, a disjunction is considered inclusive by default.

Negation

If P is a simple proposition, then P is either true or false but not both. That is, if P is a
true statement, then its truth value is true and if P is false, then its truth value is false.

If we negate P and P is true, then ~P must be false, and if P is false, then ~P must be
true. This type of analysis is shown in Table 4.

Table 4
Truth Table for a Simple Proposition’s Negation (~)
P ~P
T F
F T

Example 4: Construct a truth table for

a. ~(P ^ Q) b. ~(P v Q) c. ~(P ^ ~Q)

Solution:
a. ~(P ^ Q)

i. List the truth values of the variables P ii. Complete the column for connective ^
and Q. ~(P ^ Q).
P Q P^Q ~(P ^ Q) P Q P^Q ~(P ^ Q)
T T T T T
T F T F F
F T F T F
F F F F F

iii. Complete the truth table by negating iv. Steps can be summarized as shown
the statement inside the parentheses below:
(the conjunction).
P Q P^Q ~(P ^ Q) P Q P^Q ~(P ^ Q)
T T T F T T T F
T F F T T F F T
F T F T F T F T
F F F T F F F T
b. ~(P v Q)
i. List the truth values of the variables P ii. Complete the column for connective
and Q. v ~(P v Q).
P Q PvQ ~(P v Q) P Q PvQ ~(P v Q)
T T T T T
T F T F T
F T F T T
F F F F F

iii. Complete the truth table by negating

the statement inside the parentheses
(the disjunction).
P Q PvQ ~(P v Q)
T T T F
T F F F
F T F F
F F F T

c. ~(P ^ ~Q)
 List the truth values of the
variables P and Q (Column 1
and 2)
 Complete Column 3 by
negating Q.
 Complete Column 4 (P ^ ~Q).
 Complete Column 5 by
negating (P ^ ~Q)(Column 4)
 Steps can be summarized as
shown below:
P Q ~Q P ^ ~Q ~(P ^ ~Q)
T T F F T
T F T T F
F T F F T
F F T F T
1 2 3 4 5

Truth Tables for Conditional and Biconditional

Table 5
Truth Table for Conditional Statement (P => Q)
P Q P => Q
T T T
T F F
F T T
F F T

Example 5: Construct a truth table for each of the following:

a. P => ~Q b. ~P => Q
Solution:
a. P => ~Q
 The dominant connective is =>.
 Complete the columns under the simple statements P and Q
in Column 1 and 2.
 Negate statement Q to get entries in Column 3.
 Finally, combine Column 1 and 3 using the connective => to
get the truth values for P => ~Q. Write the result in Column 4.

P Q ~Q P => ~Q
T T F F
T F T T
F T F T
F F T T
1 2 3 4

b. ~P => Q
 The dominant connective is =>.
 Complete the columns under the simple statements P and Q
in Column 1 and 2.
 Negate statement P to get entries in Column 3.
 Finally, combine Column 2 and 3 using the connective => to
get the truth values for ~P => Q. Write the result in Column 4.

P Q ~P ~P => Q
T T F T
T F F T
F T T T
F F T F
1 2 3 4

Table 6
Truth Table of Biconditional (P Q)
P Q PQ
T T T
T F F
F T T
F F T

Example 6: Construct the truth table for each statement:

a. (P => Q)  (~P => Q)

Solution:
a. (P => Q)  (~P => Q)
 The dominant connective is .
 Complete the columns under the simple statements P and Q in Column 1 and 2.
 Negate statement P to get entries in Column 3.
 Combine column 1 and 2 using the connective => to get the truth values for P => Q.
Write the result in column 4.
 Combine column 3 and 2 using the connective => to get the truth values for ~P =>Q.
 Write the result in column 5.
 Finally, combine column 4 and 5 using the connective  to get the truth values for (P
=> Q)  (~P => Q). Write the result in column 6.
P Q ~P P => Q ~P => Q (P => Q)  (~P => Q)
T T F T T T
T F F F T F
F T T T T T
F F T T F F
1 2 3 4 5 6

ACTIVITY 20.0
Direction: Construct a truth table for each statement.

1. ~(P v Q)
2. P ^ ~Q
3. ~P v ~Q
4. Q v (~P ^ Q
5. (P v ~Q)  (P => Q)