General Mathematics

Quarter 2 – Module 17:

Logical Equivalence and
Conditional Propositions

CO_Q2_General Mathematics (SHS)_ Module 17

General Mathematics – Senior High School
Alternative Delivery Mode
Quarter 2 – Module 17: Logical Equivalence and Conditional Propositions
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

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

Development Team of the Module

Writer: Azenith A. Gallano-Mercado
Editors: Elizabeth D. Lalunio, Anicia J. Villaruel, Roy O. Natividad
Reviewers: Jerry Punongbayan, Diosmar O. Fernandez, Dexter M. Valle
Illustrator: Hanna Lorraine Luna, Diane C. Jupiter
Layout Artist: Roy O. Natividad, Sayre M. Dialola, Argie L. Ty
Management Team: Wilfredo E. Cabral, Job S. Zape Jr, Eugenio S. Adrao, Elaine T.
Balaogan, Fe M. Ong-ongowan, Hermogenes M. Panganiban,
Gerlie M. Ilagan, Josephine T. Natividad, Anicia J. Villaruel,
Dexter M. Valle

Printed in the Philippines by ________________________

Department of Education – Region IV-A CALABARZON

Office Address: Gate 2 Karangalan Village, Barangay San Isidro

Cainta, Rizal 1800
Telefax: 02-8682-5773/8684-4914/8647-7487
E-mail Address: [email protected]
General Mathematics
Quarter 2 – Module 17:
Logical Equivalence and
Conditional Propositions
Introductory Message

This Self-Learning Module (SLM) is prepared so that you, our dear

learners, can continue your studies and learn while at home. Activities,
questions, directions, exercises, and discussions are carefully stated for you
to understand each lesson.

Each SLM is composed of different parts. Each part shall guide you
step-by-step as you discover and understand the lesson prepared for you.

Pre-tests are provided to measure your prior knowledge on lessons in

each SLM. This will tell you if you need to proceed on completing this module
or if you need to ask your facilitator or your teacher’s assistance for better
understanding of the lesson. At the end of each module, you need to answer
the post-test to self-check your learning. Answer keys are provided for each
activity and test. We trust that you will be honest in using these.

In addition to the material in the main text, Notes to the Teacher are
also provided to our facilitators and parents for strategies and reminders on
how they can best help you on your home-based learning.

Please use this module with care. Do not put unnecessary marks on
any part of this SLM. Use a separate sheet of paper in answering the exercises
and tests. And read the instructions carefully before performing each task.

If you have any questions in using this SLM or any difficulty in

answering the tasks in this module, do not hesitate to consult your teacher
or facilitator.

Thank you.

iii
 What I Need to Know
KnowKnowKnow
This module was designed and written with you in mind. It is here to help you
master logical equivalence and conditional propositions. The scope of this module
permits it to be used in many different learning situations. The language used
recognizes the diverse vocabulary level of students. The lessons are arranged to follow
the standard sequence of the course. But the order in which you read them can be
changed to correspond with the textbook you are now using.

After going through this module, you are expected to:

1. illustrate the different forms of conditional propositions;
2. verify the logical equivalences;
3. state the converse, contrapositive, and inverse of a conditional proposition;
and
4. clarify a real-life instance using logical equivalence and conditional
proposition.

What I Know

Choose the letter of the best answer. Write the chosen letter on a separate
sheet of paper.

1. What is the symbol used in referring to logically equivalent propositions?

a. ∧ c. ⟺
b. ∨ d. ↔

For item numbers 2-7, verify ~[𝑝 ∨ (~𝑝 ∧ 𝑞)] ⟺ (~𝑝 ⋀ ~𝑞).

2. Which of the following supports the logical equivalence

~[𝑝 ∨ (~𝑝 ∧ 𝑞)] ⟺ (~𝑝) ∧ ~(~𝑝 ∧ 𝑞)?
a. De Morgan’s Law c. Idempotent Law
b. Identity Law d. Double Negation

3. Which of the following supports the logical equivalence

(~𝑝) ∧ ~(~𝑝 ∧ 𝑞) ⟺ ~𝑝 ∧ [~(~𝑝) ∨ (~𝑞)?
a. Double Negation c. Identity Law
b. Idempotent Law d. De Morgan’s Law

1
CO_Q2_General Mathematics (SHS)_ Module 17
4. Which of the following supports the logical equivalence
~𝑝 ∧ [~(~𝑝) ∨ (~𝑞) ⟺ ~𝑝 ∧ (𝑝 ∨ ~𝑞)?
a. Double Negation c. Identity Law
b. Idempotent Law d. De Morgan’s Law

5. Which of the following supports the logical equivalence

~𝑝 ∧ (𝑝 ∨ ~𝑞) ⟺ (~𝑝 ∧ 𝑝) ∨ (~𝑝 ∧ ~𝑞)?
a. Associative Law c. Commutative Law
b. Distributive Law d. Switcheroo Law

6. Which of the following supports the logical equivalence

(~𝑝 ∧ 𝑝) ∨ (~𝑝 ∧ ~𝑞) ⟺ 𝜙 ∨ (~𝑝 ∧ ~ ∧ 𝑞)?
a. Switcheroo Law c. Domination Law
b. Absorption Law d. Inverse Law

7. Which of the following supports the logical equivalence

𝜙 ∨ (~𝑝 ∧ ~ ∧ 𝑞) ⟺ ~𝑝 ∧ ~𝑞?
a. Domination Law c. Idempotent Law
b. Identity Law d. Double Negation

8. Which of the following logical equivalence is being depicted by

𝑝 ∧ (𝑞 ∧ 𝑟) ⟺ (𝑝 ∧ 𝑞) ∧ 𝑟?
a. Identity Law c. Associative Law
b. Commutative Law d. Distributive Law

9. Which of the following are logically equivalents?

a. converse and contrapositive c. conditional and inverse
b. contrapositive and conditional d. conditional and converse

For item numbers 10-15, refer to the conditional proposition, “If yema cake is
consumed in large volumes, then it can be harmful to one’s health”.

10. What type of conditionals is being depicted by the conditional statement, “If
yema cake is not consumed in large volumes, then it cannot be harmful to
one’s health”?
a. converse c. inverse
b. contrapositive d. equivalence

11. Which of the following represents item number 10?

a. ~𝑝 ⟶ ~𝑞 c. ~𝑞 ⟶ ~𝑝
b. 𝑝 ⟶ 𝑞 d. 𝑞 ⟶ 𝑝

12. What type of conditionals is being depicted by the conditional statement, “If
yema cake can be harmful to one’s health, then it is consumed in large
volumes”?
a. converse c. inverse
b. contrapositive d. equivalence
2
CO_Q2_General Mathematics (SHS)_ Module 17
13. Which of the following represents item number 12?
a. 𝑝 ⟶ 𝑞 c. 𝑞 ⟶ 𝑝
b. ~𝑝 ⟶ ~𝑞 d. ~𝑞 ⟶ ~𝑝

14. What type of conditionals is being depicted by the conditional statement, “If yema
cake cannot be harmful to one’s health, then it is not consumed in large
volumes”?
a. converse c. inverse
b. contrapositive d. equivalence

15. Which of the following represents item number 14?

a. 𝑝 ⟶ 𝑞 c. 𝑞 ⟶ 𝑝
b. ~𝑝 ⟶ ~𝑞 d. ~𝑞 ⟶ ~𝑝

3
CO_Q2_General Mathematics (SHS)_ Module 17
 Lesson
Logical Equivalence and
1 Conditional Propositions

Do you easily believe in everything you hear? How do you know whether a
statement is true or not? It is difficult to claim the truthfulness of one thing without
a basis. That applies to everything. So, the next time you hear humor, before
believing, one thing you must consider is to let it undergo a process. Because
sometimes, there is no shortcut.

What’s In

In the past lessons, you have learned the different logical operators, including
negation (~), conjunction (∧), disjunction (∨), conditional (⟶), and
biconditional (⟷).
These logical operators connect propositions and make them compound ones.
And truth values of said propositions can be determined through the use of a truth
table.
Let us see whether you can still recall the truth values of logical operators
when used in compound propositions.

Activity 1. Show Me What is True!

Fill in the missing cells of the table.
𝒑 𝒒 𝒑→𝒒 𝒒→𝒑 (𝒑 → 𝒒) ∨ (𝒒 → 𝒑)
T T
T F
F T
F F
Third and fourth columns used conditional. All values for
𝑝 → 𝑞 “p implies q” are true except in the case where p is true and q is false. On the
other hand, all values for 𝑞 → 𝑝 “q implies p” are true except in the case where q is
true and p is false.
The last column involves disjunction
(𝑝 → 𝑞) ∨ (𝑞 → 𝑝) “p implies q” or “q implies p”. As you have noticed with the truth
values you obtained in this column, all are true. And this we call a tautology 𝜏, in
which a proposition is always true.

4
CO_Q2_General Mathematics (SHS)_ Module 17
Activity 2. Prove Me, I’m Wrong!
Complete the following table.
𝒑 𝒒 𝒑→𝒒 ~(𝒑 → 𝒒) 𝒒 ∧ ~(𝒑 → 𝒒)
T T
T F
F T
F F
As recalled above, in the third column 𝑝 → 𝑞 “p implies q”, all are true except
in the case where p is true and q is false. Whereas, the fourth column ~(𝑝 → 𝑞)
“negation of p implies q” denies 𝑝 → 𝑞. Thus, making all that which are true in the
third column, as false; and with that which is the only false in the former as the only
true in the fourth column.
The fifth column involves the conjunction 𝑞 ∧ ~(𝑝 → 𝑞) “q and negation of p
implies q”. How did it differ from the last column in the first table? If you have
observed, this time, all are false. This proposition that always results in false values
is a contradiction 𝜙.

What’s New

Activity 3. Complete Me!

Decide for the truth values of the propositions in a truth table below.
𝒑 𝒒 𝒑→𝒒 ~𝒑 (~𝒑) ∨ 𝒒 (𝒑 → 𝒒) ⟷ [(~𝒑) ∨ 𝒒]
T T
T F
F T
F F

Questions:
1. What truth values do you get for 𝑝 → 𝑞?
2. What truth values do you get for ~𝑝?
3. What truth values do you get for (~𝑝) ∨ 𝑞?
4. What have you noticed with every pair of corresponding truth values in the
third and fifth columns?
5. What can you infer from the sixth column?
As mentioned in the other previous activities above, the conditional 𝑝 → 𝑞
results to all true values except in the case where p is true and q is false. For ~𝑝,
values of p are simply negated. That is if p is true, then ~𝑝 is false, and vice-versa.
On the other hand, for the disjunction (~𝑝) ∨ 𝑞, all are true except when both ~𝑝 and
q are false.
Comparing the third and fifth columns, you can easily notice that they have
the same truth values. Moreover, it turns out that when propositions are perfectly

5
CO_Q2_General Mathematics (SHS)_ Module 17
alike, their biconditional will yield values that are all true. Hence, they result in a
tautology, as observed in the last column.

What is It

Two propositions p and q are said to be logically equivalent if they have the
same values in the truth table and if the biconditional 𝑝 ⟷ 𝑞 is a tautology. It is
denoted by 𝑝 ⟺ 𝑞 or 𝑝 ≡ 𝑞.
The above activity shows that (𝑝 → 𝑞) ⟺ [(~𝑝) ∨ 𝑞]. This logical equation is
called Switcheroo Law.
Aside from this, below is a table of various logical equations.
Table of Logical Equivalences
Let p, q, and r be propositions.
Identity Law (𝑝 ∧ 𝜏) ⟺ 𝑝 (𝑝 ∨ 𝜙) ⟺ 𝑝
Domination Law (𝑝 ∨ 𝜏) ⟺ 𝜏 (𝑝 ∧ 𝜙) ⟺ 𝜙
Idempotent Law (𝑝 ∨ 𝑝) ⟺ 𝑝 (𝑝 ∧ 𝑝) ⟺ 𝑝
Inverse Law [𝑝 ∨ (~𝑝)] ⟺ 𝜏 [𝑝 ∧ (~𝑝)] ⟺ 𝜙
Double Negation ~(~𝑝) ⟺ 𝑝
Associative Law 𝑝 ∨ (𝑞 ∨ 𝑟) ⟺ (𝑝 ∨ 𝑞) ∨ 𝑟 𝑝 ∧ (𝑞 ∧ 𝑟) ⟺ (𝑝 ∧ 𝑞) ∧ 𝑟
Commutative Law 𝑝∨𝑞 ⟺𝑞∨𝑝 𝑝∧𝑞 ⟺ 𝑞∧𝑝
Distributive Law 𝑝 ∨ (𝑞 ∧ 𝑟) ⟺ (𝑝 ∨ 𝑞) ∧ (𝑝 ∨ 𝑟) 𝑝 ∧ (𝑞 ∨ 𝑟) ⟺ (𝑝 ∧ 𝑞) ∨ (𝑝 ∧ 𝑟)
De Morgan’s Law ~(𝑝 ∨ 𝑞) ⟺ (~𝑝) ∧ (~𝑞) ~(𝑝 ∧ 𝑞) ⟺ (~𝑝) ∨ (~𝑞)
Absorption Law 𝑝 ∨ (𝑝 ∧ 𝑞) ⟺ 𝑝 𝑝 ∧ (𝑝 ∨ 𝑞) ⟺ 𝑝
Switcheroo Law 𝑝 → 𝑞 ⟺ ~𝑝 ∨ 𝑞

Example 1: Using logical equivalences, verify that ~(𝑝 → 𝑞) ⟺ [𝑝 ∧ (~𝑞)].

Proposition Reason
~(𝑝 → 𝑞) Given
⟺ ~[(~𝑝) ∨ 𝑞] Switcheroo Law
⟺ ~(~𝑝) ∧ (~𝑞) De Morgan’s Law
⟺ 𝑝 ∧ (~𝑞) Double Negation

Moreover, the conditional proposition 𝑝 → 𝑞 can be illustrated in three other

conditional statements. They are the following:
1. Converse: 𝑞 → 𝑝
2. Contrapositive: (~𝑞) → (~𝑝)
3. Inverse: (~𝑝) → (~𝑞)
A conditional and its contrapositive are logically equivalent. In the same
manner, based on a given conditional proposition, its converse and inverse are
logically equivalent.

6
CO_Q2_General Mathematics (SHS)_ Module 17
Example 2: Given the following conditional, “If you want lesser traffic, then pass
through the Eco-Tourism Road”; state its converse, contrapositive and inverse.
1. Converse 𝑞 → 𝑝: If you pass through the Eco-Tourism Road, then you want
lesser traffic.
2. Contrapositive (~𝑞) → (~𝑝):
If you do not pass through
the Eco-Tourism Road, then
you do not want lesser
traffic.
3. Inverse (~𝑝) → (~𝑞): If you
do not want lesser traffic,
then do not pass through
the Eco-Tourism Road.

What’s More

Activity 1.1
Tell whether the propositions [(𝑝 ⟶ 𝑞) ∧ ~𝑞] and ~(𝑝 ∨ 𝑞) are logically
equivalent by filling in the correct logical equivalence for each statement.
Proposition Reason
[(𝑝 ⟶ 𝑞) ∧ ~𝑞] Given
⟺ (~𝑝 ∨ 𝑞) ∧ ~𝑞
⟺ ~𝑞 ∧ (~𝑝 ∨ 𝑞)
⟺ (~𝑞 ∧ ~𝑝) ∨ (~𝑞 ∧ 𝑞)
⟺ (~𝑞 ∧ ~𝑝) ∨ 𝜙
⟺ (~𝑞 ∧ ~𝑝)
⟺ (~𝑝 ∧ ~𝑞)
⟺ ~(𝑝 ∨ 𝑞)

Activity 1.2
Using the conditional proposition “If you want to meet some of the indigenous
people, then you may go to Barangay Barra”, state the following:

Converse : _________________________________________________________
1. Contrapositive: ____________________________________________________
2. Inverse : ___________________________________________________________

7
CO_Q2_General Mathematics (SHS)_ Module 17
 What I Have Learned

Fill in the blanks of the following statements with the correct missing words
or phrases.
1. Logically equivalent propositions are _______________________________
2. Converse is a conditional statement ________________________________
3. Contrapositive is a conditional statement ___________________________
4. Inverse is a conditional statement __________________________________
5. The pairs of conditional statements which are logically equivalents are
___________________________________________________________________
6. Name and state the laws supporting logical equivalences between
propositions. _______________________________________________________

What I Can Do

This lesson helps you understand propositions which are logically equivalent.
You also have learned the three other forms of conditional propositions. In this
connection, suppose Matmat is your little brother and your mother promised him
that “If you limit the use of Facebook, then we will go at Buddy’s more frequently.”
And then your father added that because “If we will not go at Buddy’s more
frequently, then you will not limit the use of Facebook.” These seem to be confusing
to him. How will you explain these to Matmat?

Try scoring your essay using the rubric below.

Criteria 4 3 2 1
Content Very relative Somewhat Less relative Not relative to
to the topic relative to the to the topic the topic and
and well- topic and and poorly very poorly
organized organized organized organized
Spelling, No spelling, Very few Several Many spelling,
Grammar, and punctuation or spelling, spelling, punctuation,
Punctuations grammatical punctuation, punctuation, and
errors and and grammatical
grammatical grammatical errors
errors errors
Congratulations if your score ranges from 6 to 8. But when you scored 5 and
below, try revising it.

8
CO_Q2_General Mathematics (SHS)_ Module 17
 Assessment

Multiple Choice. Choose the letter of the best answer. Write the chosen letter
on a separate sheet of paper.

1. What do you call two propositions with the same truth values?
a. logically equivalent c. contradictions
b. tautologies d. fallacies

For item numbers 2-7, verify ~(𝑞 → 𝑝) ∨ (𝑝 ∧ 𝑞) ⟺ 𝑞.

2. Which of the following supports the logical equivalence

~(𝑞 → 𝑝) ∨ (𝑝 ∧ 𝑞) ⟺ ~(~𝑞 ∨ 𝑝) ∨ (𝑝 ∧ 𝑞)?
a. Absorption Law c. Switcheroo Law
b. De Morgan’s Law d. Commutative Law

3. Which of the following supports the logical equivalence

~(~𝑞 ∨ 𝑝) ∨ (𝑝 ∧ 𝑞) ⟺ (𝑞 ∧ ~𝑝) ∨ (𝑝 ∧ 𝑞)?
a. Absorption Law and Double Negation
b. De Morgan’s Law and Double Negation
c. Switcheroo Law and Double Negation
d. Commutative Law and Double Negation

4. Which of the following supports the logical equivalence

(𝑞 ∧ ~𝑝) ∨ (𝑝 ∧ 𝑞) ⟺ (𝑞 ∧ ~𝑝) ∨ (𝑞 ∧ 𝑝)?

a. Associative Law c. Distributive Law
b. Commutative Law d. Identity Law

3. Which of the following supports the logical equivalence

(𝑞 ∧ ~𝑝) ∨ (𝑞 ∧ 𝑝) ⟺ 𝑞 ∧ (~𝑝 ∨ 𝑝)?
a. Switcheroo Law c. Idempotent Law
b. Identity Law d. Distributive Law

6. Which of the following supports the logical equivalence

𝑞 ∧ (~𝑝 ∨ 𝑝) ⟺ 𝑞 ∧ 𝜏?
a. Domination Law c. Absorption Law
b. Identity Law d. Inverse Law
7. Which of the following supports the logical equivalence 𝑞 ∧ 𝜏 ⟺ 𝑞?
a. Identity Law c. Inverse Law
b. Domination Law d. Absorption Law

9
CO_Q2_General Mathematics (SHS)_ Module 17
8. Which of the following logical equivalences is being depicted by
𝑝 ∧ (𝑞 ∨ 𝑟) ⟺ (𝑝 ∧ 𝑞) ∨ (𝑝 ∧ 𝑟)?
a. Identity Law c. Associative Law
b. Commutative Law d. Distributive Law

9. Which of the following are logically equivalents?

a. converse and contrapositive c. converse and inverse
b. contrapositive and inverse d. conditional and converse

For item numbers 10-15, refer to the conditional proposition, “If you are
proud of Manuel L. Quezon, then you must take pride in being a Filipino”.

10. What type of conditionals is being depicted by the conditional statement, “If you
take pride in being a Filipino, then you are proud of Manuel L. Quezon”?
a. converse c. inverse
b. contrapositive d. equivalence

11. Which of the following represents item number 10?

a. 𝑞 ⟶ 𝑝 c. ~𝑞 ⟶ ~𝑝
b. 𝑝 ⟶ 𝑞 d. ~𝑝 ⟶ ~𝑞

12. What type of conditionals is being depicted by the conditional statement, “If you
do not take pride in being a Filipino, then you are not proud of Manuel Luis
Quezon”?
a. converse c. inverse
b. contrapositive d. equivalence

13. Which of the following represents item number 12?

a. 𝑝 ⟶ 𝑞 c. 𝑞 ⟶ 𝑝
b. ~𝑝 ⟶ ~𝑞 d. ~𝑞 ⟶ ~𝑝

14. What type of conditionals is being depicted by the conditional statement, “If you
are not proud of Manuel L. Quezon, then you must not take pride in being a
Filipino”?
a. converse c. inverse
b. contrapositive d. equivalence

15. Which of the following represents item number 14?

a. 𝑝 ⟶ 𝑞 c. 𝑞 ⟶ 𝑝
b. ~𝑝 ⟶ ~𝑞 d. ~𝑞 ⟶ ~𝑝

10
CO_Q2_General Mathematics (SHS)_ Module 17
 Additional Activities

A. Verify the logical equivalence (𝑝 ∧ 𝑞) → 𝑟 ⟺ [(𝑝 → 𝑟) ∨ (𝑞 → 𝑟)].

B. Think of a conditional statement. Cite its converse, contrapositive, and inverse.
Conditional: ___________________________________________________________
Converse: _____________________________________________________________
Contrapositive: ________________________________________________________
Inverse: _______________________________________________________________

11
CO_Q2_General Mathematics (SHS)_ Module 17
CO_Q2_General Mathematics (SHS)_ Module 17
12
What I Know What's More Assessment
1. c Activity 1.1 1. a
2. a Switcheroo Law 2. c
3. d Commutative Law 3. b
4. a Associative Law 4. b
5. b
Inverse Law 5. d
6. d
7. b Identity Law 6. d
8. c Commutative Law 7. a
9. b De Morgan’s law 8. d
10. c 9. c
11. a Activity 1.2 10. a
12. a
1. If you go to Brgy. Barra, 11. a
13. c
14. b then you may meet some of 12. b
15. d the indigent people. 13. d
2. If you do not go to Brgy. 14. c
Barra, then you may not 15. b
meet some of the indigent
people.
3. If you do not want to meet
some of the indigent people,
then you may not go to
Brgy. Barra.
Answer Key
References

Dimasuay, Lynie, Alcala, Jeric. Palacio Jane. General Mathematics. Quezon City
Philippines: C & E Publishing, Inc.2016
General Mathematics Learner’s Material. First Edition. 2016. P. 263-269

*DepED Material: General Mathematics Learner’s Material

13
CO_Q2_General Mathematics (SHS)_ Module 17
For inquiries or feedback, please write or call:

Department of Education - Bureau of Learning Resources (DepEd-BLR)

Ground Floor, Bonifacio Bldg., DepEd Complex

Meralco Avenue, Pasig City, Philippines 1600

Telefax: (632) 8634-1072; 8634-1054; 8631-4985

Email Address: [email protected] * [email protected]