Senior High School

General Mathematics
Quarter 2 - Module 8
Truth Values and
Forms of Conditional Propositions
M11GM-IIh-1-2
 General Mathematics- Grade 11
Alternative Delivery Mode
Quarter 2- Module 8: Truth Tables and Forms of Conditional Proposition
First Edition 2020

Republic Act 8293 section 176 No copyright shall subsist in any 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, such as work for a 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 book 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 - Region III

Secretary : Leonor M. Briones
Undersecretary : Diosdado M. San Antonio

Development Team of the Module

Writer : Sherwin A. Maglonzo

Content Editor : Aldwin C. Mateo
Language Reviewer : Grace M. Yumang
Illustrator : Sherwin A. Maglonzo
Layout Artist : Sherwin A. Maglonzo

Management Team:

Gregorio C. Quinto, Jr. EdD

Chief, Curriculum Implementation Division

Rainelda M. Blanco, PhD

Education Program Supervisor - LRMDS

Agnes R. Bernardo, PhD

EPS-Division ADM Coordinator

Francisco B. Macale
Division Focal Person - Mathematics

Glenda S. Constantino
Project Development Officer II

Joannarie C. Garcia
Librian II

Department of Education, Schools Division of Bulacan

Curriculum Implementation Division
Learning Resource Management and Development System (LRMDS)
Capitol Compound, Guinhawa St., City of Malolos, Bulacan
 11
General Mathematics
Quarter 2- Module 8
Truth Values and
Forms of Conditional Proposition
M11GM-IIh-1-2
 Introductory Message
For the facilitator:
Welcome to the General Mathematics 11 Alternative Delivery Mode (ADM) Module on
Truth Tables and Forms of Conditional Proposition.
This module was collaboratively designed, developed and reviewed by educators from
public institutions to assist you, the teacher or facilitator, in helping the learners meet the
standards set by the K to 12 Curriculum while overcoming their personal, social, and
economic constraints in schooling.
This learning resource hopes to engage the learners into guided and independent learning
activities at their own pace and time. Furthermore, this also aims to help learners acquire
the needed 21st-century skills while taking into consideration their needs and
circumstances.
In addition to the material in the main text, you will also see this box in the body of the
module:

Notes to the Teacher

This contains helpful tips or strategies that
will help you in guiding the learners.

As a facilitator, you are expected to orient the learners on how to use this module. You
also need to keep track of the learners’ progress while allowing them to manage their own
learning. Furthermore, you are expected to encourage and assist the learners as they do
the tasks included in the module.

For the learner:

Welcome to the General Mathematics 11 Alternative Delivery Mode (ADM) Module on
Truth Tables and Forms of Conditional Proposition.
This module was designed to provide you with fun and meaningful opportunities for
guided and independent learning at your own pace and time. You will be enabled to
process the contents of the learning resource while being an active learner.
This module has the following parts and corresponding icons:

This will give you an idea of the skills or competencies you are
What I Need to Know
expected to learn in the module.

This part includes an activity that aims to check what you

What I Know already know about the lesson to take. If you get all the
answers correct (100%), you may decide to skip this module.

1
 This is a brief drill or review to help you link the current lesson
What’s In
with the previous one.

In this portion, the new lesson will be introduced to you in vari-

What’s New ous ways; a story, a song, a poem, a problem opener, an activity
or a situation.

This section provides a brief discussion of the lesson. This aims

What Is It
to help you discover and understand new concepts and skills.

This comprises activities for independent practice to solidify your

understanding and skills of the topic. You may check the an-
What’s More
swers to the exercises using the Answer Key at the end of the
module.

This includes questions or blank sentence/paragraph to be filled

What I Have Learned
in to process what you learned from the lesson.

This section provides an activity which will help you transfer

What I Can Do
your new knowledge or skill into real life situations or concerns

This is a task which aims to evaluate your level of mastery in

Assessment
achieving the learning competency.

In this portion, another activity will be given to you to enrich your

Additional Activities
knowledge or skill of the lesson learned.

Answer Key This contains answers to all activities in the module.

At the end of this module you will also find:

References - This is a list of all sources used in developing this module.
The following are some reminders in using this module:
1. Use the module with care. Do not put unnecessary mark/s on any part of the
module. Use a separate sheet of paper in answering the exercises.
2. Don’t forget to answer What I Know before moving on to the other activities
included in the module.
3. Read the instruction carefully before doing each task.
4. Observe honesty and integrity in doing the tasks and checking your answers.
5. Finish the task at hand before proceeding to the next.
6. Return this module to your teacher/facilitator once you are through with it.
If you encounter any difficulty in answering the tasks in this module, do not hesitate to
consult your teacher or facilitator. Always bear in mind that you are not alone.
We hope that through this material, you will experience meaningful learning and gain
deep understanding of the relevant competencies. You can do it!

2
 What I Need to Know
This module is designed and written to help you to learn about the truth values
and forms of conditional proposition. In all lessons, you are given the opportunity to use
your prior knowledge and skills in propositions and symbols. Activities are also given to
process your knowledge and skills acquired, deepen and transfer your understanding of
the different lessons.
At the end of this module, you are expected to:
• construct truth tables;

• determine the truth values of propositions using truth tables;

• define logical equivalence; and

• illustrate the different forms of conditional propositions.

What I Know
Directions: Choose the letter of the correct answer in each number and write your answer
on a separate sheet of paper.

1. It refers to the truth or falsity of a proposition.

a. truth table
b. truth value
c. false table
d. false value

2. Given: r: You give me twenty pesos.

s: I will be your best friend.
Problem: Which of the following statements represents, "If you give me twenty pesos,
then I will be your best friend"?
a. r ^ s c. s → r
b. r → s d. None of the above

3. It is the truth value of r → s when the hypothesis is false and the conclusion is true in
Question 2.
a. True c. Not enough information was given
b. False d. None of the above

4. Given: a: x is prime.
b: x is odd.
Problem: What is the truth value of a → b when x = 2?
a. True c. Not enough information was given
b. False d. None of the above

3
5. It is the truth value of a → b when x = 9 in Question 4.
a. True c. Not enough information was given
b. False d. None of the above

6. It is the logical equivalence is ∼ (∼ p) ⟷ p.

a. Double Negation
b. Associative Laws
c. De Morgan’s Law
d. Switcheroo Law

7. If constructing the truth table of the statement (p → q) ↔ (~p ∨ q), what is the result in
the last column?
a. T, T, T, T c. T, T, F, F
b. T, F, T, T d. F, F, F, F

8. It is the negation of the statement “All summer days are muggy.”

a. All muggy days are summer.
b. Some summer days are muggy.
c. Some summer days are not muggy.
d. No summer days are muggy.

9. It is the converse of the conditional statement “ If I cut classes, then I miss the quiz”.
a. If I cut classes, then I don’t miss the quiz.
b. If I don’t miss the quiz, then I don’t cut classes.
c. If I miss the quiz, then I cut classes.
d. If I don’t cut classes, then I miss the quiz.

10. It is the inverse of the conditional statement “ If I am in Malolos, then I am in Bulacan”.

a. If I am not in Malolos, then I am not in Bulacan.
b. If I am not in Bulacan, then I am in not Malolos.
c. If I am in Bulacan, then I am in Malolos.
d. If I am in Bulacan, then I am in not Malolos.

11. It is the contrapositive of the conditional statement “ If it is signal no. 3, then all classes
are suspended”.
a. If it is signal no. 3, then all classes are not suspended.
b. If all classes are not suspended, then it is not signal no. 3.
c. If it is not signal no. 3, then all classes are not suspended.
d. If all classes are suspended, then it is not signal no. 3.

12. It is the three forms of conditional propositions.

a. converse, inverse, conjunction
b. disjunction, conjunction, negation
c. converse, inverse, contrapositive
d. contrapositive, inverse, biconditional

13. It is the truth value of the proposition “If 2 > 0, then there are only 5 languages spoken
in the Philippines.”.
a. True c. Not enough information was given
b. False d. None of the above

4
14. It is the truth value of the proposition “Nami is in Grade 11 if and only if she is a senior
high school student.”?
a. True c. Not enough information was given
b. False d. None of the above

15. It is the logical equivalence of conditional?

a. conjunction
b. inverse
c. converse
d. contrapositive

What’s In
In the previous lesson you learned about the simple and compound propositions;
and perform the different types of operations on propositions. Let’s recall the different
terms from the previous lesson.

Directions: Rearrange the jumbled letters to identify the following statement. Write your
answer on your answer sheet.

1. It is a declarative sentence that can be classified as true or false, but not both.
IT POPOSIONR

2. It refers to two simple propositions connected using the word and.

TUNJONCCION

3. It is a statement that is false whenever the given statement is true, and true whenever
the given statement is false.
EGNATI NO

4. it is refer to two simple propositions that are connected using the word if… then.
CLAONTIDION

5. it is refer to two simple propositions connected using the word or.

TINJUNCDIOS

6. A sentence that makes a statement and gives information that normally ends with a full
– stop/period.
LARATIVDECE

7. This sentence expresses strong emotion/surprise – an exclamation – and always ends

with an exclamation mark/point.
CLAEXOR MATY

8. If two proposition p and q are connected by the connective ‘if and only if” then the
resulting compound proposition “p if and only if q” .
CONDOBINAITIL

9. It conveys one thought with no connecting words using variable p as first statement.
SIMTIOEPROPPLOSIN

10. It contains two or more simple propositions that are combined together using
connecting words
P O D P R O P T I O C O M O S I NU N

5
 What’s New
If you get high grades
and with honors, then
I will buy you a cell
phone.

Rina’s mother promised her to buy her a cellphone if she get high grades and with
honors. Which of the following scenarios is true?

Scenario A: Rina got high grades and with honors and her mother bought her a cell
phone.
Scenario B: Rina get high grades but not with honors still her mother bought her a cell
phone.
Scenario C: Rina did not get high grades and with honors but her mother bought her a
cell phone.

We live in a world where logic is everything. You cannot solve even a simple
addition problem without logic behind it. However, when you are learning about the truth
value of any scenario, you need to keep one major thing in your mind. The answer will be
either true or false. There is no in between, and there is no such thing as no answer or both
answers. A statement in logic is usually built around statements using logic connectives.
Thus, the truth/false answer of any statement depends on these connectives.

What Is It
Truth Values and Forms of Conditional Proposition

The truth or falsity of a proposition is called its truth value. The truth value of a
compound proposition can be calculated from the truth values of its components, using the
following rules:
• For a conjunction to be true, both conjuncts must be true.
• For a disjunction to be true, at least one disjunct must be true.
• A negation has the opposite value of the negated proposition.
• A conditional is true except when the antecedent is true and the consequent false.
• For a biconditional to be true, the two input values must be the same (either both
true or both false).

6
 To describe the possible truth values for various compound propositions it is useful
to construct a truth table—a table in which each row represents a distinct possible set of
truth values for the sentence letters, and a column lists the corresponding truth values for
the compound proposition.

Example: Since a proposition has two possible truth values, a proposition p would have
the following truth table.
p
T
F
The truth table is useful because we can use it to display all the possible truth value
combinations of two or more propositions. For example, suppose p and q are propositions.
We can construct a truth table displaying the relationship between the possible truth values
of p and the truth values of q. The rows of the table will correspond to each of the possible
truth value combination of p and q, and so there will be 2 2 = 4 rows. Thus, for propositions
p and q, we have the following table.

p q
T T

T F

F T
F F

Similarly, suppose p, q, and r are propositions. Then a truth table involving the given
propositions has 2 3 = 8 rows as shown below.

p q r
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F

In general, a truth table involving n propositions has 2 n rows.

If a given proposition is a compound proposition, the truth table is used to exhibit
the relationship between the truth values of its simple components and the truth values of
the given compound proposition. Following are the truth tables of 5 connectives.
7
1. Conjunction
The conjunction of propositions p and q is denoted by p ˄ q. The connective and
implies the idea of “both”. Its truth table is shown in table 1.

The propositions p and q are called conjuncts.

Table 1.
Example:
p q p˄q
p: 7 > 5
T T T
q: 12 < 0
T F F p is true and q is false.
p ˄ q: 7 > 5 and 12 < 0
F T F
The conjunction p ˄ q is
F F F
true when p and q are
Solution: both true; otherwise the
The statement 7 > 5 is true. Hence, p is true. conjunction is false.
The statement 12 < 0 is false. Hence, q is false.
The second row of the conjunction truth table shows
that p ˄ q is false.

2. Disjunction
The disjunction of propositions p and q is denoted by p ˅ q which represents the
compound statement “p or q”. The propositions p and q are called disjuncts.

In natural languages “or” has two distinct meanings :

Table 2.
1. Inclusive Or: p ˅ q is true if either p or q
p q p˅q
or both are true. Table 2 shows the truth table for
inclusive disjunction p or q. T T T
T F T
Inclusive disjunction F T T
is true unless both
F F F
components are
false.

2. Exclusive Or : p ⊻ q is true if either p or q but Table 3.

not both are true. Table 2 shows the truth table for p q p⊻q
exclusive disjunction p or q.
T T F

Exclusive disjunction is T F T
true when one component F T T
is true and the other is F F F
false.

8
 Examples:
1. “Math 10a or Math 12 may be taken as a prerequisite for CS 6”
Meaning: take either one but may also take both
2. “Soup or salad comes with this entrée”
Meaning: do not expect to get both

3. Negation

The negation of a proposition p is denoted by ∽p.

Table 4 shows the truth table for a Simple Proposition’s Negation

Table 4. ∽p is false when p is

p ∽p true, and ∽p is true,
T F when p is false.
F T

Example: State the negation of the following propositions.

1. The tinikling is the most difficult dance.
2. 2 is an odd number.
3. Everyone in Visayas speaks Cebuano.
Solution:
1. The tinikling is not the most difficult dance.
2. It is not true that 2 is an odd number', or `2 is an even number.
3. Not everyone in Visayas speaks Cebuano.

It is a common mistake to assume that the proposition ∼p is

automatically false, just because it involves a negation.
However, ∼ p can be true, this happens when p is false. For
example, negation of example no. 2 is true because example
is false.
Also note that negation ∼p is not necessarily the complete
opposite of p. For example, the negation of the statement
`Everyone in Visayas speaks Cebuano' merely states that
there are Visayans who do not speak Cebuano. The negation
does not say that all Visayans do not speak Cebuano.

9
4. Conditional
Conditional statement is denoted by p → q which means that “if p then q”. These
are sometimes called implications, where p is called the hypothesis (antecedent) and q
is called the conclusion (consequent).

Table 5.
p q p→q p → q is false only
when p is true and q is
T T T
false; otherwise it is
T F F true.
F T T
F F T

Examples:
Find the truth value of each statement.
1. If 3 + 3 = 9, then 33 = 6.
Solution:
Let P represent “3 + 3 = 9”, and Q represent “33 = 6.” Since 3 + 3 = 9 is false and
33 = 6 is false, then P → Q is true.
2. If 3 + 3 = 6, then 12 = 7.
Solution:
Let P represent “3 + 3 = 6”, and Q represent “12 = 7.” Since 3 + 3 = 6 is true and
12 = 7 is false, then P → Q is false.
3. If 5 is whole number, then 7 is a real number.
Solution:
Let P represent “5 is whole number”, and Q represent “7 is a real number.” Since 5
is whole number is true and 7 is a real number is true, then P → Q is true.

Another way to understand the truth value of conditional proposition p → q is to

think of it as a promise or a contract. The conditional p → q is false or, equivalently, the
promise is broken when the hypothesis p is true, while the conclusion q is false.

Let’s take a look back of the 3 scenarios of the statement “If you get high grades and with
honors, then I will buy you a cell phone.”, and determine which of these scenarios is true.

Scenario A: Rina got high grades and with honors and her mother bought her a cell
phone.
Scenario B: Rina get high grades but not with honors still her mother bought her a cell
phone.
Scenario C: Rina did not get high grades and with honors but her mother bought her a
cell phone.

10
Solution:
Scenario A: In this scenario both the hypothesis and the conclusion are true. This means
that Rina’s mother kept his promise. According to the 1st row of the truth table, the
conditional p → q is true.
Scenario B: In this scenario, Rina’s mother broke his promise. According to the second
row of the truth table, the conditional p → q is false.
Scenario C: In this scenario, did Rina’s mother break her promise? Of course not. Her
mother did not say that getting only high grades and with honors is the only way to make
her buy a cell phone. Perhaps Rina got a special award! In any case her mother did not
break her promise, and according to the third and fourth rows of the truth table, the
conditional p → q is true.
In fact, the truth table asserts that when the hypothesis p is false, the conditional p → q is
true regardless of the truth value of the conclusion q.

5. Biconditional
Bi-conditional statements are conditional statements which depend on both
component propositions. They read "p if and only if q" and are denoted p↔q or "p if q",
which is logically equivalent to (p→q)∧(q→p).
Table 6.
p q p⟷q p ⟷ q is true only
T T T when and only when p
and q have the same
T F F truth value.
F T F
F F T
Example: Suppose that Sam is a Grade 11 student. Let us now consider the following
biconditionals:
a: Sam is in Grade 11 if and only if she is a senior high school student.
b: Sam is in Grade 11 if and only if she is working as a lawyer.
c: Sam has a degree in Computer Science if and only if she believes in true love.
Analyze the truth values of the given biconditionals.
Solution:
a: Again, both simple components of a are true. Hence, the biconditional is true, according
to the rst row of the truth table.
b: Since it is true that Sam is in Grade 11 but it is not true that Sam is working as a lawyer,
the biconditional is false as the second row of the truth table indicates.
c: The truth value of the biconditional c depends on whether Sam believes in true love or
not. If Sam does not believe in true love, then both components of the biconditional are
false which makes the biconditional true according to the truth table. On the other hand,
supposing Sam believes in true love, the truth value of biconditional is false

11
Now let’s study how to construct truth tables for other compound statements.

Constructing Truth Tables

1. Determine if the final result is a conjunction, disjunction or negation.
Recall dominant connectives and the use of parentheses.
2. Complete the columns under
(a) The simple statements (P, Q, …)
(b) The connectives negations inside parentheses
(c) Any remaining statements and their negations
(d) Any remaining connectives
reaching the final column as determined in Step 1.
Number the columns in the order they are completed and highlight
the column containing the final answer.
3. The truth table of compound proportion of n component statements,
each represented by a different letter, has 2n number of rows. For
example,
• A compound proposition with two different letters (simple statements)
has 22 or 4 rows.
• A compound proposition with three different letters (simple statements)
has 23 or 8 rows.

Example 1: Construct a truth table for ∽(P˄Q).

Solution:

a. List the truth values of the b. Complete the column for

variables P and Q. connective ˄ ∽(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

c. Complete the truth table by d. Steps can be summarized as shown

negating the statement inside the below.
parentheses (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

12
Example 2: Construct a truth table for ∽(P˅Q).
Solution:

a. List the truth values of the b. Complete the column for

variables P and Q. connective ˄ ∽(P˄Q).
P Q (P˅Q) ∽(P˅Q) P Q (P˅Q) ∽(P˅Q)
T T T T T
T F T F T
F T F T T
F F F F F

c. Complete the truth table by negating the statement inside the parentheses (the
disjunction).

P Q (P˅Q) ∽(P˅Q)
T T T F
T F F F
F T F F
F F F T

Example 3: Construct a truth table for ∽(P˄∽Q).

Solution:

a. List the truth values of the b. Complete the column 3 by

variables P and Q. negating Q.
P Q ∽Q (P˄∽Q) ∽(P˄∽Q) P Q ∽Q (P˄∽Q) ∽(P˄∽Q)
T T T T F
T F T F T
F T F T F
F F F F T

c. Complete the column 4 (P˄∽Q). d. Complete the column 5 ∽(P˄∽Q).

P Q ∽Q (P˄∽Q) ∽(P˄∽Q) P Q ∽Q (P˄∽Q) ∽(P˄∽Q)

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

13
Example 4: Construct the truth table of the compound proposition (p → q) ∧ (q → p).
Solution:
a. Note that there are two propositions, b. Using the truth table for the definition
p and q, involved in the compound of the conditional statements and ,
proposition. Thus, the truth table will we add two more columns to
indicate the truth values of and :
contain 4 rows, the first two columns
of which are

p q p q p →q q→p
T T T T T T
T F T F F T
F T F T T F
F F F F T T

c. In the final column, we add the truth value of , which is a conjunction involving
and as disjuncts.

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

Example 5: Combine the truth tables of the conjunction (p → q) ∧ (q → p) and biconditional

p ↔ q.

p q (p →q) ∧ (q→p) p↔q

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

Observe that the third and fourth columns are exactly the same, which means that these
two propositions have the same truth values! We call such pair of propositions logically
equivalent.

LOGICAL EQUIVALENCE
Two propositions p and q that have the same truth values for all possible truth
values of their simple components are said to be logically equivalent and denoted by
p⟷q or p≡q.

14
 Example 1: Show that (p → q) ↔ [(∼ p) ∨ q]. We shall call this logical equivalence the
Switcheroo law.
Solution:
We show that (p → q) and (∼ p) ∨ q have the same truth tables

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

The following table presents logical equivalences which are commonly used in logical
manipulations.

Table of Logical Equivalences

Let p, q, and r be propositions. One can verify using truth tables that the following are
indeed logical equivalences.

Idempotent Laws (p ∨ p) ⟷ p (p ∧ p) ⟷ p
Double negation ∼ (∼ p) ⟷ p
Associative Laws p ∨ (p ∨ r) ⟷ (p ∨ q) ∨ r p ∧ (p ∧ r) ⟷ (p ∧ q) ∧ r
Commutative Laws p∨q⟷q∨p p∧q⟷q∧p
Distributive Laws p ∨ (q ∧ r) ⟷ (p ∨ q) ∧ (p ∨ r) p ∧ (q ∨ r) ⟷ (p ∧ q) ∨ (p ∧ r)
De Morgan’s laws ∼ (p ∨ q) ⟷ (∼p) ∧ (∼q) ∼ (p ∧ q) ⟷ (∼p) ∨ (∼q)
Absorption Laws p ∨ (p ∧ q) ⟷ p p ∧ (p ∨ q) ⟷ p

Example 2. Show that ∼ (p → q) ↔ [p ∧ (∼ q)] using logical equivalences.

Solution:
One way to do this is to construct a truth table for each logical expression then
show that they have the same truth values. Another method is to use the logical
equivalences to transform into ∼ (p → q) into p ∧ (∼ q).

Reason
∼ (p ⟶ q) Given
⟷ ∼ ((∼p) ∨ q) Switcheroo
⟷ ∼ (∼p) ∧ (∼ q) De Morgan’s Laws
⟷ p ∨ (∼ q) Double Negation

15
Example 3: Construct the truth tables for each of the following conditionals: p →q , q→p,
∽p→∽q, ∽q→∽p.
Solution: We construct a single table containing each of the conditionals:

p q ∼p ∼q p→q q→p ∽p→∽q ∽q→∽p

T T F F T T T T

T F F T F T T F

F T T F T F F T

F F T T T T T T

Note that the fifth and eighth columns are the same, so we have shown that p→q ↔
∽q→∽p. Likewise, since the sixth and seventh columns are identical, it follows that q→p
∽p→∽q.
The conditionals that we considered in the previous example are the different forms
of conditional propositions.

FORMS OF CONDITIONAL PROPOSITIONS

Suppose p and q are propositions. From the conditional proposition , we derive
three other conditional statements, namely its
Note:
a. Converse of p→q q→p  Converse and
inverse are
b. Inverse of p→q ∽p→∽q equivalent.

c. Contrapositive  Conditional and

∽q→∽p contrapositive are
p→q
equivalent.

We can also show that (p→q) ↔ (∽q→∽p) using logical equivalences in the following
manner.

Reason
∼q⟶∼p Given

⟷ ∼(∼ q) ∨ ∼ p Double Switcheroo

⟷q∨∼p Double Negation

⟷∼p∨q Commutative Laws

⟷p⟶q Switcheroo

16
Likewise, we can also show that (q→p) ↔ (∽p→∽q) by means of logical equivalences:

Reason

∼p⟶∼q Given

⟷ ∼(∼ p) ∨ (∼ q)) Switcheroo

⟷p∨∼q Double Negation

⟷ (∼ q) ∧ p Commutative Laws

⟷q⟶p Switcheroo

Example: Write the conditional statement, identify its hypothesis and conclusion. Form its
converse, inverse and contrapositive of the statement below and tell whether each is true
or false.
Statement:
“a triangle has three congruent sides; it is an equilateral triangle”.

Solution:
Conditional Statement:
“If a triangle has three congruent sides, then it is an equilateral triangle”
Hypothesis:
a triangle has three congruent sides
Conclusion:
It is an equilateral triangle.
Converse:
“If it is an equilateral triangle, then a triangle has three congruent sides.” (True)
Inverse:
“If a triangle does not have three congruent sides, then it is not an equilateral
triangle” (True)
Contrapositive:
“If it is not an equilateral triangle, then a triangle does not have three congruent
sides” (True)

What’s More

INDEPENDENT ACTIVITY 1
Directions: Write ✓ if the statement is true and X if it is not. Write your answer on your
answer sheet.
_____ 1. A conditional (⟶) is true in all cases except when the antecedent is true and the
consequent is false.
_____ 2. A conjunction (∨) is only true when both components are false.

17
_____ 3. A disjunction (∧) is true unless both components are true.
_____ 4. A biconditional (⟷) is true when both components have the same truth value.
_____ 5. A negation (∼) changes the value of the statement to its opposite.
_____ 6. Converse and inverse proposition are logically equivalent.
_____ 7. Two propositions p and q are logically equivalent if they have the same truth
values of their simple propositions.
_____ 8. The negation of the proposition “Mary received a text message from her friend” is
“Mary did not receive a text message from her friend.”
_____ 9. The converse of the proposition “If it is consumed in large volumes, then
chocolate can be harmful to one’s health.” is “If chocolate is not harmful to one’s
health, then it is consumed in large volumes.
_____ 10. Truth table show only some possible truth values.

INDEPENDENT ASSESSMENT 1

Directions: Fill in the blanks of the appropriate word/s or symbol that would make the
sentence correct. Choose your answer from the table below. Write your
answer on a separate sheet of paper.

Any proposition can be represented by a (1) __________, which shows truth

values for all combinations of its constituent variables.

The (2) __________ of propositions p and q is denoted by p ˄ q. The

connective (3) _____ implies the ideas “both”.

Disjunction of propositions p and q is denoted by (4) __________ which

represents the compound statement “p (5)____q”. (6) __________ disjunction is true
unless both components are (7) __________ , while (8)__________ is false only
when p is (9) ______ and q is false, otherwise it is true.

Two propositions P and Q that have the same truth values are said to be (10)
__________ and denoted by P ⟷ or P ≡ Q.

and conjunction Truth table inclusive false

Logically
true conditional or p∨q
equivalent

18
INDEPENDENT ACTIVITY 2
Directions: Write the negation of the following propositions. Write your answer on a
separate sheet of paper.

1. Mathematics is easy to study.

2. James was not able to fetch his sister from school today.
3. Eden teachers high-level mathematics to college students.
4. x2 + y2 = z2
5. Logic is not taken up in senior high school.

INDEPENDENT ASSESSMENT 2
A. Directions: Complete the table below to show that the given compound proposition are
equivalent. Write your answer on a separate sheet of paper.

1. ∼(p ⟶ (∼q)) ⟷ (p ∧ q)

Reason
∼ (p ⟶ (∼q) Given
⟷ ∼ ((∼p) ∨ ∼q)
⟷ ∼ (∼p) ∧ ∼(∼ q)
⟷ p ∧q

2. (p ⟶ (q ∧ r)) ⟷ ((p ⟶ q) ∧ (p ⟶ r))

Reason
(p ⟶ (q ∧ r)) Given
⟷ ∼ p ∨ (q ∧ r)
⟷ (p ∨ q) ∧ (∼p ∨ r)
⟷ ((p ⟶ q) ∧ (p ⟶ r))

B. Directions: Write the following in symbolic form. Write your answer on your answer
sheet.
Given: P = An integer is odd
Q = its square is odd.
1. If integer is odd, then its square is odd.
2. If its square is not odd, then an integer is not odd.
3. Its square is odd or an integer is odd.
4. An integer is not odd and its square is not odd.
5. An integer is odd if and only if its square is odd.

19
INDEPENDENT ACTIVITY 3
A. Directions: Complete the truth table for the given statement by filling in the required
columns. Write your answers on your answer sheet.
1. ∼ (p ∧ q)

p q p∧q ∼ (p ∧ q)
T T
T F
F T
F F

2. (p ⟶ q) ∧ (q ⟶ p)

p q p ⟶q q ⟶p (p ⟶ q) ∧ (q ⟶ p)
T T
T F
F T
F F

B. Directions: Construct a truth table for each statement. Let p and q be propositions,
construct the truth table for the compound proposition. Write your answers
on your answer sheet.
3. p ∨ ∼ (p ∧ q)
4. (p ∧ q) ⟷ ∼ (p ⟶ q)

INDEPENDENT ASSESSMENT 3
Directions: Write the converse, inverse and contrapositive for each statement and
determine whether each statement is true. Write your answer on your answer
sheet.
1. If it is red, then it is not a cabbage.
Converse: ______________________________
Inverse: ________________________________
Contrapositive: ___________________________

2. If a triangle has no sides congruent, then it is scalene.

Converse: _______________________________
Inverse: _________________________________
Contrapositive: ____________________________

20
3. If you are native Bulakenyo, then you are born in Bulacan.
Converse: _______________________________
Inverse: _________________________________
Contrapositive: ____________________________

What I Have Learned

Directions: Answer the following questions in 3 - 5 sentences. Write your answer on a
separate sheet of paper.

1. How do you construct a truth tables?

___________________________________________________________
___________________________________________________________
___________________________________________________________

2. Give the 3 forms of conditional propositions and explain each.

___________________________________________________________
___________________________________________________________
___________________________________________________________

3. Explain logical equivalence and give an example.

___________________________________________________________
___________________________________________________________
___________________________________________________________

What I Can Do

Conditional Statements help you make a decision on certain conditions.

We're both thinking about what we're going to do in the future, whether we're going
to figure out our weekend or decide what to do for dinner. But things don't always go as
they were expected. Understanding that other factors can have an effect on the course of
events in our day, we make conditional plans.

If I hadn’t watch movie

If I don’t eat, I late at night, then I
will be hungry. wouldn’t be sleepy.

21
 As a Grade 11 student, list 1 situation in your day-to-day life where you think
twice before settling on the decision you are going to make, much like the examples.
Write your answer in the form of a "if-then" statement, and write the converse, the
inverse, and the opposite.

If…then...

Assessment
Directions: Choose the letter of the correct answer in each number and write your answer
on a separate sheet of paper.

1. Given: r: You give me twenty pesos.

s: I will be your best friend.
Problem: Which of the following statements represents, "If you give me twenty pesos,
then I will be your best friend"?
a. r ^ s c. s → r
b. r → s d. None of the above

2. It is the truth value of r → s when the hypothesis is false and the conclusion is true in
Question 1?
a. True c. Not enough information was given
b. False d. None of the above

3. In constructing the truth table of the statement (q → p) ↔ (~p → ∼q), what is the result
in the last column?
a. T, T, T, T c. T, T, F, T
b. T, F, T, F d. F, F, F, F

4. Consider the scenario. One Friday night, Victor and Janree are busy studying for their
Logic exam. Meanwhile, Eumir just tweeted a picture of himself eating crispy pata and
sisig! What is the truth value of the proposition (∼ p) ∨ (q ∧ r)?
a. True c. Not enough information was given
b. False d. None of the above

5. It is the truth value of the proposition “If 2 > 0, then there are only 5 languages spoken
in the Philippines.”?
a. True c. Not enough information was given
b. False d. None of the above

6. It is the truth value of the proposition “Nami is in Grade 11 if and only if she is a senior
high school student.”?
a. True c. Not enough information was given
b. False d. None of the above

22
7. It is the converse of the statement “ If I cut classes, then I miss the quiz”.
a. If I cut classes, then I don’t miss the quiz.
b. If I don’t miss the quiz, then I don’t cut classes.
c. If I miss the quiz, then I cut classes.
d. If I don’t cut classes, then I miss the quiz.

8. It is the inverse of the statement “ If I am in Malolos, then I am in Bulacan”.

a. If I am not in Malolos, then I am not in Bulacan.
b. If I am not in Bulacan, then I am in not Malolos.
c. If I am in Bulacan, then I am in Malolos.
d. If I am in Bulacan, then I am in not Malolos.

9. It is the contrapositive of the statement “ If it is signal no. 3, then all classes are
suspended”.
a. If it is signal no. 3, then all classes are not suspended.
b. If all classes are not suspended, then it is not signal no. 3.
c. If it is not signal no. 3, then all classes are not suspended.
d. If all classes are suspended, then it is not signal no. 3.

10. It is the negation of the statement “All summer days are muggy.”
a. All muggy days are summer.
b. Some summer days are muggy.
c. Some summer days are not muggy.
d. No summer days are muggy.

11. It is logical equivalence is ∼ (∼ p) ⟷ p.

a. Double Negation
b. Associative Laws
c. De Morgan’s Law
d. Switcheroo Law

12. It is the three forms of conditional propositions.

a. converse, inverse, conjunction
b. disjunction, conjunction, negation
c. converse, inverse, contrapositive
d. contrapositive, inverse, biconditional

13. It is the truth table for disjunction.

a. c.
p q p˄q p q p→q
T T T T T T
T F F T F F
F T F F T T
F F F F F T
b. d.
p q p˅q p q p⟷q
T T T T T T
T F T T F F
F T T F T F
F F F F F T

23
14. It is the truth table for conjunction.
a. p q p˄q c.
p q p→q
T T T T T T
T F F T F F
F T F F T T
F F F F F T

b. p q p˅q d. p q p⟷q
T T T T T T
T F T T F F
F T T F T F
F F F F F T

15. It is the logical equivalence of contrapositive.

a. conjunction
b. inverse
c. converse
d. conditional

Additional Activities

Directions: Write a conditional statement with each of the following set of characteristics.
1.The conditional is true, and its converse is true.
2.The conditional is true, and its converse is false.
3.The conditional is true, and its converse and inverse are false.

24
 25
What I Know
Independent Activity 2
1. b 6. a 11. b 1. Mathematics is not easy to study.
2. b 7. b 12. c 2. James was able to fetch his sister from school today.
3. Eden does not teach high-level mathematics to college student.
3. a 8. d 13. b
4. x2 + y2 ≠ z2
4. b 9. c 14. a 5. Logic is taken up in senior high school.
5. a 10. a 15. d Independent Asessment 2
A.
What’s In 1. Switcheroo, De Morgan’s Law, Double Negation
1. PROPOSITION 2. Switcheroo, Distributive Law, Switcheroo
2. CONJUNCTION B.
3. NEGATION 1. P ⟶ Q
4. CONDITIONAL 2. ∼Q ⟶ ∼P
5. DISJUNCTION 3. Q∨P
6. DECALRATIVE 4. ∼P ∧ ∼Q
7. EXCLAMATORY
5. P⟷Q
8. BICONDITIONAL
9. SIMPLE PROPOSITION
Independent Activity 3
10. COMPOUND PROPOSITION A. 1. 2.
p ∧ q ∼(p ∧ q) p⟶q q⟶p p⟶q∧q⟶p
What’s More!
T F T T T
Independent Activity 1
F T F T F
1. ✓
F T T F F
2. X
3. X F T T T T
4. ✓
5. ✓ 3. p q p∧q ∼ (p ∧ q) p ∨ ∼ (p ∧ q)
6. ✓ T T T F T
7. ✓ T F F T T
8. ✓ F T F T T
9. X F F F T T
10. X
4.
Independent Assessment 1 (p ∧ q) ⟷ (∼
p q ∼p p∧q ∼p⟶q
p ⟶ q)
1. truth table T T F T T T
2. conjunction T F F F T F
3. and F T T F T F
4. p ∨ q F F T F F T
5. or
6. inclusive
7. false
8. conditional
9. true
10. logically equivalent
Answer Key
 26
Independent Assessment 3
1. Converse: If it is not a cabbage, then it is red. (False)
Inverse: If it not red, then it is a cabbage. (False)
Contrapositive: If it is a cabbage, then it is red. (True)
2. Converse: If a triangle is scalene, then it has no sides congruent. (True)
Inverse: If a triangle has congruent sides, then it is not scalene. (True)
Contrapositive: If a triangle is not scalene, then it has congruent sides. (True)
3. Converse: If you are born in Bulacan, then you are a native Bulakenyo. (True)
Inverse: If you are not native Bulakenyo, then you are not born in Bulacan. (True)
Contrapositive: If you are not born in Bulacan, then you are not native Bulakenyo.
What I Have Learned: Answers may vary
What I Can Do: Answers may vary
Assessment
1. b 6. a 11. a
2. a 7. c 12. c
3. c 8. a 13. b
4. a 9. b 14. a
5. b 10. d 15. d
Additional Activity: Answers may vary
Answer Key
 References

Oronce, O. A. (2016). General Mathematics (1st ed). Sampaloc, Manila Rex

Bookstore, Inc.

https://www.mathgoodies.com/lessons/vol9/conditional?
fbclid=IwAR32MtCB2Cz9w5wQ8CR3mt7ckwndV0D7CvRjYQNgCEMzOwq5n4
YOZLWodZA

https://www.hcusd2.org/vimages/shared/vnews/stories/53bd4762d3b99/3.4%20-%
20equivalent%20statements%20-%20FILLED%20IN%20NOTES.pdf

https://www.hcusd2.org/vimages/shared/vnews/stories/53bd4762d3b99/Chapter%
203%20Review%20(2014)%20ANSWER%20KEY.pdf

https://global.oup.com/us/companion.websites/9780199385423/student/ch6/mcq/

https://www.doe.virginia.gov/testing/solsearch/sol/math/G/m_ess_g-1.pdf

https://www.ics.uci.edu/~bic/courses/6B/ILTI/Lectures/1A-notes-1.pdf

https://www.math.fsu.edu/~wooland/hm2ed/Part2Module1/exercises.pdf

https://lrmds.deped.gov.ph/pdf-view/12238

27
 For inquiries or feedback, please write or call:

Department of Education – Region III

Learning Resource Management Section (LRMDS)
Diosdado Macapagal Government Center
Maimpis, City of San Fernando (P)