Professional Documents
Culture Documents
GenMath11 - Q2 - Mod17 - Logical-Equivalence-and-Conditional-Propositions - FINAL VERSION
GenMath11 - Q2 - Mod17 - Logical-Equivalence-and-Conditional-Propositions - FINAL VERSION
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.
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:
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.
The hand is one of the most symbolized part of the human body. It is often used to
depict skill, action and purpose. Through our hands we may learn, create and
accomplish. Hence, the hand in this learning resource signifies that you as a learner
is capable and empowered to successfully achieve the relevant competencies and
skills at your own pace and time. Your academic success lies in your own hands!
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.
iii
This module has the following parts and corresponding icons:
What I Need to Know This will give you an idea of the skills or
competencies you are expected to learn in the
module.
iv
At the end of this module you will also find:
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!
v
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.
What I Know
Choose the letter of the best answer. Write the chosen letter on a separate sheet of
paper.
For item numbers 2-7, verify ~[𝑝 ∨ (~𝑝 ∧ 𝑞)] ⟺ (~𝑝 ⋀ ~𝑞).
1
4. Which of the following supports the logical equivalence
~𝑝 ∧ [~(~𝑝) ∨ (~𝑞) ⟺ ~𝑝 ∧ (𝑝 ∨ ~𝑞)?
a. Double Negation c. Identity Law
b. Idempotent Law d. De Morgan’s Law
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
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
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
3
Lesson
Logical Equivalence and
1 Conditional Propositions
Do you easily believe everything you hear? How do you know whether a thing
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 receive hearsay, 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.
4
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
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
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 𝑝 → 𝑞 ⟺ ~𝑝 ∨ 𝑞
6
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 indigent
people, then you may go to Brgy. Barra”, state the following:
1. Converse : _________________________________________________________
2. Contrapositive: ____________________________________________________
3. Inverse : ___________________________________________________________
7
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 clarify 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
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
9
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. ~𝑞 ⟶ ~𝑝
Additional Activities
10
11
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
6. d Inverse Law 5. 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
12
For inquiries or feedback, please write or call: