11

General Mathematics
Quarter 2 – Module 8:
Truth Tables and Conditional
Proposition
General Mathematics – Grade 11
Alternative Delivery Mode
Quarter 2 – Module 1: Truth Tables and Conditional Proposition
First Edition, 2020

Republic Act 8293, section 176 states that: No copyright shall subsist in any work of
the Government of the Philippines. However, prior approval of the government agency or office
wherein the work is created shall be necessary for exploitation of such work for profit. Such
agency or office may, among other things, impose as a condition the payment of royalties.

Borrowed materials (i.e., songs, stories, poems, pictures, photos, brand names,
trademarks, etc.) included in this module are owned by their respective copyright holders.
Every effort has been exerted to locate and seek permission to use these materials from their
respective copyright owners. The publisher and authors do not represent nor claim ownership
over them.

Published by the Department of Education, SDO Cabanatuan City

Schools Division Superintendent: Teresa D. Mababa, CESO V
Assistant Schools Division Superintendent: Enrique E. Angeles, Jr. CESO VI

Development Team of the Module

Writer: James Denver G. Sarmiento
Editors: Lady Anne R. Bayan, PhD.
Naomi L. Caparas
Ismael A. De Lara
Sarah R. Piñgol, PhD.
Melody J. Ramos
Cezainne C. Soriano
Reviewer: SDO Cabanatuan City
Layout Artist: James Denver G. Sarmiento
Management Team: Priscilla D. Sanchez, PhD. – CID Chief
Sonny P. De Leon, PhD. – EPSvr in Mathematics
Ever M. Samson, PhD. – EPSvr in LRMDS

Printed in the Philippines by Department of Education – Region III –

Schools Division of Cabanatuan City

Office Address: Maharlika Highway, Bantug Norte, Cabanatuan City

Telefax: (044) 463-7334
E-mail Address: cabanatuan.city@deped.gov.ph
 What I Need to Know

This module was designed and written for the learners. After going through
this module, the learner is expected to:
1. determine the truth values of propositions (M11GM-IIh-1); and
2. illustrate the different forms of conditional propositions (M11GM-IIh2).

What I Know

Choose the letter that corresponds to your best answer. Write your answers on a
separate sheet of paper.

1. Let a, b, c, and d be propositions. Assume that the equivalence a ↔ (b ∨~b) and

b ↔ c hold, then truth value of the formula (a ∧ b) → ((a ∧ c) ∨ d) is always
_______________.
A. true C. same as the truth value of a
B. false D. same as the truth value of b

2. A conditional proposition is false only when the antecedent is

___________________.
A. true and the consequent is false C. true and the consequent is true
B. false and the consequent is false D. false and the consequent is true

3. In propositional logic, which of the following is equivalent to p → q?

A. ~p → q B. ~p ∨ q C. ~p ∨~ q D. p →q

4. Let p and q be propositions. Using only the truth table, which of the following
statements is true?
A. p ↔ q does not imply p → ~q C. q ↔ p does not imply q → ~p
B. p → q does not imply p → ~q D. ~p → q does not imply p ↔ q

5. For the combination p ∧ ~q, for which truth values of p and q is the combination
true?
p: The dog rolls over on command. q: The dog gets a treat.
A. p: T q: T B. p: T q: F C. p: F q: T D. p: F q: F

1
 Lesson
Truth Tables and Conditional
1 Proposition

A truth table is a visual tool, in the form of a diagram with rows and columns
that shows the truth or falsity of a compound premise. It’s a way of organizing
information to list out all possible scenarios from the provided premises. It can be
used to test the validity of arguments. Every proposition is assumed to be either true
or false and the truth or falsity of each proposition is said to be its truth-value. Each
row of the table represents a possible combination of truth-values for the compound
propositions of the compound, and there should be enough rows to cover all possible
combinations.

What’s In

Classify each sentence as declarative, imperative, interrogative, or

exclamatory.

1. The principal will visit classes starting next week.

2. Ouch! I cut my finger.
3. Turn right at the fourth traffic sign.
4. Have you heard of the good news?
5. Please reserve December 7 for me.

Answers:

1. Declarative Sentence
2. Exclamatory Sentence
3. Imperative Sentence
4. Interrogative Sentence
5. Imperative Sentence

2
 What’s New

Truth Tables and Conditional Proposition

What is truth table?

Truth table represents the relationship between the truth values of

propositions and compound proposition drawn from the given propositions.

Truth-value, in logic, describes truth or falsity of a given proposition or

statement. Logical connectives, such as conjunction (symbolized ᐱ, for “and”),
disjunction (symbolized ᐯ, for “or”), conditional (symbolized →, for “if…then),
biconditional (symbolized ↔, “if and only if”) and negation (symbolized ∼, for “not”),
can be thought of as truth-functions, because the truth-value of a compound
proposition is a function of, or a quantity dependent upon, the truth-values of its
component parts.

The truth-value of a compound statement can readily be tested by means of a

chart known as a truth table. Each row of the table represents a possible combination
of truth-values for the component propositions of the compound, and the number of
rows is determined by the number of possible combinations.

What is Conditional propositions?

Conditional propositions are compound statements. We denote them as p → q

and we think “if p then q”. These are sometimes called implications, where

• p is called the hypothesis (antecedent)

• q is called the conclusion (consequent)

You should now know the truth tables for ∧, ∨, ∼, → and ↔ . They should be
internalized as well as memorized. You must understand the symbols thoroughly, for
we now combine them to form more complex statements.

Definition 1. Truth Table of Compound Proposition p and q (p ᐱ q) is defined by

the truth table below.

p q pᐱq • The conjunction “p and q” (p ᐱ q) is

true only if both p and q are true.
T T T
Otherwise, p ᐱ q is false.
T F F
F T F
F F F

3
Definition 2. Truth Table of Compound Proposition p or q (p ᐯ q) is defined by
the truth table below.

p q pᐯq • The disjunction “p or q” (p ᐯ q) is

false only if both p and q are false.
T T T Otherwise, p ᐯ q is true.
T F T

F T T

F F F

Definition 3. Truth Table of Compound Proposition if p , then q (p → q) is defined

by the truth table below.

p q p→q • The conditional “if p , then q” (p →

q) is false only if p is true and q is
T T T false. Otherwise, p → q is true.
T F F

F T T

F F T

Definition 4. Truth Table of Compound Proposition p if and only if q (p ↔ q) is

defined by the truth table below.

p q p↔q
• The biconditional “p if and only if q”
T T T
(p ↔ q) is true if both p and q are
T F F true or if both p and q are false.
Otherwise, p ↔ q is false.
F T F
F F T

Definition 5. Truth Table of Compound Proposition if p, then ( ~ 𝑝 ) read “ not p”

is defined by the truth table below.

p ~𝒑 • The negation of a true statement is

always false.
T F • The negation of a false statement is
F T always true.

4
 What is It

Constructing truth tables

EXAMPLE 1. Let p, q, r, s, and t be propositions.

p: 1 + 3 = 5.

q: 1 is neither prime nor composite.

r: A square has 4 sides.

s: 2 is an odd number.

t: 2 and 4 are prime factors of 8.

u: A rectangle is a square.

Construct a truth table for:

1. pᐱq
2. s ᐯ ~t
3. ~r → q
4. ~t ↔ ~p
5. (p → q) ᐯ ~(t ↔ u)
Solution:

1. pᐱq
p q pᐱq
F T F
Hence, the conjunction p ᐱ q: 1 + 3 = 5 and 1 is neither prime nor composite is false.

2. s ᐯ ~t
s t ~t s ᐯ ~t
F F T T
Hence, the disjunction s ᐯ ~t: 2 is an odd number or 2 and 4 are NOT prime factors
of 8 is true.
3. ~r → u
r ~r u ~r → u
F F F T
Hence, the conditional ~r → u is true.

5
4. ~t ↔ ~p
t ~t p ~p ~t ↔ ~p
F T F T T
Hence, the biconditional ~t ↔ ~p is true.

5. (p → q) ᐯ ~(t ↔ u)
p q p→q t u t↔u ~(t ↔ u) (p → q) ᐯ ~(t ↔ u)

F T T F F T F T
Hence, (p → q) ᐯ ~(t ↔ u) is true.

Example 2. Construct the truth table of the compound proposition (p → q) ∧ (q → p).

Solution.

Step 1. As previously discussed, since there are two primitive propositions p

and q involved, the truth table should have four rows which consist of all
possible truth values combination of p and q.

p q
T T
T F
F T
F F
Step 2. The given proposition is a conjunction of the conditionals (p → q) and
(q → p) as the conjuncts. In the next two columns, we encode the truth values
of these conditionals using the definition discussed in the previous meeting.

p q p→q q→p
T T T T
T F F T
F T T F
F F T T
Step 3. In the final column, we encode the truth values of the conjunction
(p → q) ∧ (q → p) using the third and fourth columns.

p q p→q q→p (p → q) ∧ (q → p)
T T T T T
T F F T F
F T T F F
F F T T T

6
EXAMPLE 2. Consider the compound proposition [(p → r) ∧ (q → r)] → [(p ∨ q) → r].
Construct its truth table.

Solution:

The given proposition is a conditional with the propositions (p → r) ∧ (q → r)

and (p ∨ q) → r as hypothesis and conclusion, respectively. As there are three primitive
propositions p, q and r involved, its corresponding truth table should have 23 = 8
rows. The first 3 columns will be for the propositions p, q and r, and on these columns,
we encode all the possible truth value combination of p, q and r.

Step 1. Consider the hypothesis (p → r) ∧ (q → r). In the next three columns,

we encode the truth values of the compounds propositions p → r, q → r, and
their conjunction (p → r) ∧ (q → r), using the truth values of conditional and
conjunction.

p q r p→r q→r (p → r) ∧ (q → r)
T T T T T T
T T F F F F
T F T T T T
T F F F T F
F T T T T T
F T F T F F
F F T T T T
F F F T T T

Step 2. Consider the conclusion (p ∨ q) → r. We encode the truth values of

p ∨ q and the conditional (p ∨ q) → r in the next two columns.

p q r p∨q (p ∨ q) → r
T T T T T
T T F T F
T F T T T
T F F T F
F T T T T
F T F T F
F F T F T
F F F F T

7
 Step 3. On the final column, we encode the truth value of the given compound
conditional [(p →r) ∧ (q → r)] → [(p ∨ q) → r].

(p → r) ∧ (q → r) (p ∨ q) → r [(p →r) ∧ (q → r)] → [(p ∨ q) → r]

T T T
F F T
T T T
F F T
T T T
F F T
T T T
T T T

What’s More

Activity 1: Identify each symbolic statement as a conjunction, disjunction, negation,

conditional, or bi-conditional.

a. P ᐯ Q ↔ 𝑅 The double arrow is the dominant

connective and there are no parentheses. 1. _______________
b. (P ᐱ Q ) ᐯ 𝑅 The parentheses separate the statement at
the “ᐯ” connective. 2. _______________
c. ~ (P ᐯ Q ) The statement is inside the parentheses 3. ______________
d. ~ P ᐱ Q → 𝑅 ᐯ 𝑆 There are no parentheses. Thus, the
conditional arrow is stronger than any of
the other connectives. The antecedent is ~ P
ᐱ Q and the consequent is 𝑅 ᐯ 𝑆. 4. _______________

e. ~ ( P → Q ᐱ 𝑅) The negative sign is outside the

parentheses and the conditional arrow is
inside the parentheses. 5. _______________

Activity 2: Study the table and construct a true table for the given values.

P Q ~Q 𝑷 ᐱ ~𝑸 ~ ( 𝑷 ᐱ~ 𝑸)
T T
T F
F T
F F

8
 What I Have Learned

Match each proposition in Column A to its respective symbol in Column B and to its
connectives in Column C.

Column A Column B Column C

1. ______ Conjunction A. ______ → A. and
B. or
2. ______ Disjunction B. ______ ~ C. If…then
D. if and only if
3. ______ Negation C. ______ ↔ E. not

4. ______ Conditional D. ______ ᐯ

5. ______ Biconditional
E. ______ ᐱ

What I Can Do

Based on the previous lessons in General Mathematics, identify the truth value of the
following propositions and perform the tasks that follow.

m: The inverse of 𝑦 = 𝑥 − 1 is 𝑦 −1 = 𝑥 + 1.
n: The equation 𝑎𝑚 = 𝑛 can be written as log 𝑎 𝑚 = 𝑛.
p: All functions are relations.
q: The formula for present value of compound interest is
𝐹
𝑃= = 𝐹(1 + 𝑟)−𝑡 .
(1+𝑟)𝑡

Construct for truth table for:

1. m ᐱ ~n
2. p ᐯ ~q
3. (n → p) ᐯ ~(n ↔ p)

9
 Assessment

Directions: Choose the letter that corresponds to the best answer. Write the answer
on a separate sheet of paper.

1. In a truth table for a two-variable argument, the first guide column has the
following truth values:
A. T, F, F, F C. T, F, T, F
B. F, F, T, T D. T, T, F, F

2. Which of the statements CANNOT possibly be true?

p: n is an odd integer q: n is an even integer

A. p ∧ ~ q C. p ∧ q
B. ~ p ∧ q D. p ᐯ q

3. Convert from symbolic notation to words: p ∨ ~ q

p: Matthew arrives home before six o’clock.
q: Anna cooks dinner.
r: Matthew washes the dishes.

A. Either Matthew arrives home before 6:00 and Anna does not cook dinner.
B. Either Matthew arrives home before 6:00 or Matthew washes the dishes.
C. If Matthew arrives home before 6:00, then Anna does not cook dinner.
D. Either Matthew arrives home before 6:00 or Anna does not cook dinner.

4. Let a, b, c, and d be propositions. Assume that the equivalence a ↔ (b ∨ b) and

b ↔ c hold. Then truth value of the formula (a ∧ b) → ((a ∧ c) v d) is
always____________________.
A. true C. same as the truth value of a
B. false D. same as the truth value of b

5. Consider the statement, “Given that people who are in need of refuge and
consolation are opt to do odd things, it is clear that people who are opt to do odd
things are in need of refuge and consolation.” This statement, of the form
(P → Q) → (Q → P), is logically equivalent to ______________________.
A. People who are in need of refuge and consolation are not opt to do odd
things.
B. People are opt to do odd things if and only if they are in need of refuge and
consolation.
C. People who are opt to do odd things are in need of refuge and consolation.
D. People who are in need of refuge and consolation are opt to do odd things.

10
 11
What I Know Assessment I
1. A 1. D
2. A 2. C
3. B 3. D
4. A 4. A
5. B 5. C
What's More
Activity 1
1. 1 Bi- conditional
2. 2 Disjunction
3. 3 Negation
4. 4 Condition
5. 5 Negation
Activity 2
P Q ~Q 𝑷 ᐱ ~𝑸 ~ ( 𝑷 ᐱ~ 𝑸)
T T F F T
T F T T F
F T F F T
F F T F T
Answer Key
References
Book:
Crisologo, Leo Andrei, et. al, General Mathematics: Teacher’s Guide 2016. Quezon
City, Lexicon Press Inc.

12