General Mathematics Quarter 2 Module 17: Logical Equivalence and Conditional Propositions

General Mathematics Q2 Module 17 for Senior High School: verify logical equivalences and state the converse, contrapositive, and inverse of conditionals.

This is the General Mathematics Quarter 2 Module 17 self-learning module (SLM) for Senior High School, titled Logical Equivalence and Conditional Propositions. It was developed by DepEd Region 4A CALABARZON under the Alternative Delivery Mode (First Edition, 2020). The module builds on earlier lessons about logical operators. It teaches learners to prove that two propositions are logically equivalent and to write the converse, contrapositive, and inverse of an if-then statement.

On this page 7 sections

What learners will learn

After going through this module, learners 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. cite a real-life situation using logical equivalence and conditional proposition.

Tautologies, contradictions, and logical equivalence

The module first reviews the logical operators from past lessons: negation (~), conjunction (∧), disjunction (∨), conditional (→), and biconditional (↔). Through truth table activities, it introduces three key ideas:

  • Tautology (τ): a proposition that is always true. For example, (p → q) ∨ (q → p) is true in every row of the truth table.
  • Contradiction (ϕ): a proposition that is always false. For example, q ∧ ~(p → q) is false in every row.
  • Logical equivalence: two propositions p and q are logically equivalent if they have the same truth values in the truth table and their biconditional p ↔ q is a tautology. This is written p ⟺ q or p ≡ q.

In Activity 3, learners discover that p → q and (~p) ∨ q have the same truth values. This equivalence is called the Switcheroo Law.

Table of logical equivalences

The module gives these laws, where p, q, and r are propositions:

LawForm 1Form 2
Identity Law(p ∧ τ) ⟺ p(p ∨ ϕ) ⟺ p
Domination Law(p ∨ τ) ⟺ τ(p ∧ ϕ) ⟺ ϕ
Idempotent Law(p ∨ p) ⟺ p(p ∧ p) ⟺ p
Inverse Law[p ∨ (~p)] ⟺ τ[p ∧ (~p)] ⟺ ϕ
Double Negation~(~p) ⟺ p
Associative Lawp ∨ (q ∨ r) ⟺ (p ∨ q) ∨ rp ∧ (q ∧ r) ⟺ (p ∧ q) ∧ r
Commutative Lawp ∨ q ⟺ q ∨ pp ∧ q ⟺ q ∧ p
Distributive Lawp ∨ (q ∧ r) ⟺ (p ∨ q) ∧ (p ∨ r)p ∧ (q ∨ r) ⟺ (p ∧ q) ∨ (p ∧ r)
De Morgan’s Law~(p ∨ q) ⟺ (~p) ∧ (~q)~(p ∧ q) ⟺ (~p) ∨ (~q)
Absorption Lawp ∨ (p ∧ q) ⟺ pp ∧ (p ∨ q) ⟺ p
Switcheroo Lawp → q ⟺ ~p ∨ q

Worked example: verifying an equivalence

To verify that ~(p → q) ⟺ p ∧ (~q), the module rewrites one step at a time and gives a reason for each step:

PropositionReason
~(p → q)Given
⟺ ~[(~p) ∨ q]Switcheroo Law
⟺ ~(~p) ∧ (~q)De Morgan’s Law
⟺ p ∧ (~q)Double Negation

Converse, contrapositive, and inverse

A conditional p → q (“if p, then q”) has three related forms:

  • Converse: q → p
  • Contrapositive: (~q) → (~p)
  • Inverse: (~p) → (~q)

A conditional and its contrapositive are logically equivalent. In the same way, the converse and the inverse are logically equivalent to each other.

The module’s example uses the conditional “If the weather is fine, then I will go to the beach.”

  • Converse: If I go to the beach, then the weather is fine.
  • Contrapositive: If I do not go to the beach, then the weather is not fine.
  • Inverse: If the weather is not fine, then I will not go to the beach.

Parts of the module

  • What I Know: a 15-item multiple-choice pretest.
  • What’s In: truth table review (Activities 1 and 2) on tautologies and contradictions.
  • What’s New: Activity 3, a truth table that leads to the Switcheroo Law.
  • What is It: the lesson proper, the table of laws, and two examples.
  • What’s More: Activity 1.1 (name the law that supports each step of a proof) and Activity 1.2 (write the converse, contrapositive, and inverse of “If I eat foods high in carbohydrates, then I will gain weight.”).
  • What I Have Learned: fill-in-the-blank summary statements.
  • What I Can Do: create your own real-life conditional, state its three other forms, and explain which pairs are equivalent. A rubric scores the statements and the reasoning.
  • Assessment: a 15-item multiple-choice post-test.
  • Additional Activities: verify (p ∧ q) → r ⟺ [(p → r) ∨ (q → r)] and write another conditional with its three forms.
  • Answer Key: for the pretest, What’s More, and the Assessment.

How to use this module

  • Learners: Start with the pretest to check what you already know. Then work through the parts in order. Write all answers on a separate sheet of paper and do not mark the module. Check your work honestly with the answer key, and ask your teacher or facilitator when you get stuck.
  • Parents and facilitators: Help your child follow the parts in order. Make sure the pretest and post-test are answered before the answer key is checked.
  • Teachers: The Notes to the Teacher ask you to guide students through the activities and to explain the reasons behind each answer. The What I Can Do task and its rubric work well as a performance output.

Frequently asked questions

What grade and quarter is this General Mathematics module for?

It is Quarter 2, Module 17 of General Mathematics, a Senior High School subject. The module does not name a specific grade.

What does logically equivalent mean in this module?

Two propositions are logically equivalent if they have the same truth values in the truth table and their biconditional is a tautology. This is written p ⟺ q or p ≡ q.

Which conditional statements are logically equivalent?

A conditional and its contrapositive are logically equivalent. The converse and the inverse are also logically equivalent to each other.

What is the Switcheroo Law?

The Switcheroo Law states that the conditional p → q is logically equivalent to ~p ∨ q. Learners discover it in Activity 3 using a truth table.

Does the module have an answer key?

Yes. The answer key covers the pretest (What I Know), Activities 1.1 and 1.2 under What’s More, and the Assessment.

Full text of the module

The text below is a transcription of the PDF above, as printed.

General Mathematics Quarter 2 – Module 17: Logical Equivalence and Conditional Propositions

Senior High School

[illustration: students reading and studying outdoors and at a table, with a teacher, a globe, and a lantern]

CO_Q2_General Mathematics SHS Module 16

GOVERNMENT PROPERTY NOT FOR SALE

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

Printed in the Philippines by _______________________

Development Team of the Module

Writer: Azenith G. Mercado

Editors: Elizabeth D. Lalunio, Anicia J. Villaruel and Roy O. Natividad

Reviewers: Jerry Punongbayan, Diosmar O. Fernandez, Dexter M. Valle, Mary Grace Constantino, Adrian Catapat and Moahna Aura M. Mancenido

Illustrators: Hanna Lorraine Luna, Diane C. Jupiter and Michael A. Alonzo

Layout Artists: Roy O. Natividad, Sayre M. Dialola, Argie L. Ty and Glydel Eveth T. Enriquez

Management Team: Francis Cesar B. Bringas, Job S. Zape, Jr., Ramonito Elumbaring, Reicon C. Condes, Elaine T. Balaogan, Fe M. Ong-ongowan, Hermogenes M. Panganiban, Philip B. Gallendez, Josephine T. Natividad, Anicia J. Villaruel, Dexter M. Valle

Department of Education – Region 4A CALABARZON

Office Address: Gate 2 Karangalan Village, Brgy. San Isidro, Cainta, Rizal Telefax: 02-8682-5773/8684-4914/8647-7487 E-mail Address: lrmd.calabarzon@deped.gov.ph

General Mathematics

Quarter 2 – Module 17: Logical Equivalence and Conditional Propositions

Senior High School

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.

What I Need to Know

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. cite a real-life situation using logical equivalence and conditional proposition.

What I Know

Choose the letter of the best answer and write it 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 ~[𝑝 ∨ (~𝑝 ∧ 𝑞)] ⟺ (~𝑝 ⋀ ~𝑞).

  1. Which of the following supports the logical equivalence ~[𝑝 ∨ (~𝑝 ∧ 𝑞)] ⟺ (~𝑝) ∧ ~(~𝑝 ∧ 𝑞)?

    • a. De Morgan’s Law
    • c. Idempotent Law
    • b. Identity Law
    • d. Double Negation
  2. Which of the following supports the logical equivalence (~𝑝) ∧ ~(~𝑝 ∧ 𝑞) ⟺ 𝑝 ∧ [(~𝑝) ∨ (~𝑞)?

    • a. Double Negation
    • c. Identity Law
    • b. Idempotent Law
    • d. De Morgan’s Law
  3. Which of the following supports the logical equivalence 𝑝 ∧ [(~𝑝) ∨ (~𝑞) ⟺ ~𝑝 ∧ (𝑝 ∨ ~𝑞)?

    • a. Double Negation
    • c. Identity Law
    • b. Idempotent Law
    • d. De Morgan’s Law
  4. Which of the following supports the logical equivalence ~𝑝 ∧ (𝑝 ∨ ~𝑞) ⟺ (~𝑝 ∧ 𝑝) ∨ (~𝑝 ∧ ~𝑞)?

    • a. Associative Law
    • c. Commutative Law
    • b. Distributive Law
    • d. Switcheroo Law
  5. Which of the following supports the logical equivalence (~𝑝 ∧ 𝑝) ∨ (~𝑝 ∧ ~𝑞) ⟺ 𝜙 ∨ (~𝑝 ∧ ~ ∧ 𝑞)?

    • a. Switcheroo Law
    • c. Domination Law
    • b. Absorption Law
    • d. Inverse Law
  6. Which of the following supports the logical equivalence 𝜙 ∨ (~𝑝 ∧ ~ ∧ 𝑞) ⟺ ~𝑝 ∧ ~𝑞?

    • a. Domination Law
    • c. Idempotent Law
    • b. Identity Law
    • d. Double Negation
  7. Which of the following logical equivalence is being depicted by 𝑝 ∧ (𝑞 ∧ 𝑟) ⟺ (𝑝 ∧ 𝑞) ∧ 𝑟?

    • a. Identity Law
    • c. Associative Law
    • b. Commutative Law
    • d. Distributive Law
  8. 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 a quadrilateral is a square, then it has equal sides”.

  1. What type of conditionals is being depicted by the conditional statement, “If a quadrilateral is not a square, then it does not have equal sides.”?

    • a. converse
    • c. inverse
    • b. contrapositive
    • d. equivalence
  2. Which of the following represents item number 10?

    • a. ~𝑝 ⟶ ~𝑞
    • c. ~𝑞 ⟶ ~𝑝
    • b. 𝑝 ⟶ 𝑞
    • d. 𝑞 ⟶ 𝑝
  3. What type of conditionals is being depicted by the conditional statement, “If a quadrilateral has equal sides, then it is a ssquare.”?

    • a. converse
    • c. inverse
    • b. contrapositive
    • d. equivalence
  4. Which of the following represents item number 12?

    • a. 𝑝 ⟶ 𝑞
    • c. 𝑞 ⟶ 𝑝
    • b. ~𝑝 ⟶ ~𝑞
    • d. ~𝑞 ⟶ ~𝑝
  5. What type of conditionals is being depicted by the conditional statement, “If a quadrilateral does not have equal sides, then it is not a square.”?

    • a. converse
    • c. inverse
    • b. contrapositive
    • d. equivalence
  6. Which of the following represents item number 14?

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

Lesson 1 Logical Equivalence and 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 a rumor, 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.

𝒑𝒒𝒑 → 𝒒𝒒 → 𝒑(𝒑 → 𝒒) ∨ (𝒒 → 𝒑)
TT
TF
FT
FF

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.

Activity 2. Prove Me, I’m Wrong!

Complete the following table.

𝒑𝒒𝒑 → 𝒒~(𝒑 → 𝒒)𝒒 ∧ ~(𝒑 → 𝒒)
TT
TF
FT
FF

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 𝜙.

Notes to the Teacher

Guide students in performing the activities. Explain further the reasons behind the answers in each activity.

What’s New
Activity 3. Complete Me!

Decide for the truth values of the propositions in a truth table below.

𝒑𝒒𝒑 → 𝒒~𝒑(~𝒑) ∨ 𝒒(𝒑 → 𝒒) ⟷ [(~𝒑) ∨ 𝒒]
TT
TF
FT
FF

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 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 𝑝 and 𝑞 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 𝑝, 𝑞, and 𝑟 be propositions.

[transcriber’s note: the table has no printed column headings; the header row is blank]

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 ~(𝑝 → 𝑞) ⟺ [𝑝 ∧ (~𝑞)].

PropositionReason
~(𝑝 → 𝑞)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.

Example 2: Given the following conditional, “If the weather is fine, then I will go to the beach.”; state its converse, contrapositive and inverse.

  1. Converse 𝑞 → 𝑝: If I go to the beach, then the weather is fine.
  2. Contrapositive (~𝑞) → (~𝑝): If I do not go to the beach, then the weather is not fine.
  3. Inverse (~𝑝) → (~𝑞): If the weather is not fine, then I will not go to the beach.
What’s More
Activity 1.1

Tell whether the propositions [(𝑝 → 𝑞) ∧ ~𝑞] and ~(𝑝 ∨ 𝑞) are logically equivalent by filling in the correct logical equivalence for each statement.

PropositionReason
[(𝑝 → 𝑞) ∧ ~𝑞]Given
⟺ (~𝑝 ∨ 𝑞) ∧ ~𝑞
⟺ ~𝑞 ∧ (~𝑝 ∨ 𝑞)
⟺ (~𝑞 ∧ ~𝑝) ∨ (~𝑞 ∧ 𝑞)
⟺ (~𝑞 ∧ ~𝑝) ∨ 𝜙
⟺ (~𝑞 ∧ ~𝑝)
⟺ (~𝑝 ∧ ~𝑞)
⟺ ~(𝑝 ∨ 𝑞)
Activity 1.2

Using the conditional proposition “If I eat foods high in carbohydrates, then I will gain weight.”, state the following:

  1. Converse : _____
  2. Contrapositive: _____
  3. Inverse : _____
What I Have Learned

Fill in the blanks with the correct words or phrases to complete the following statements.

  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, construct a real-life conditional proposition and state its converse, contrapositive, and inverse. State which pairs are logically equivalent and explain what make them so.

Try scoring your essay using the rubric below.

Criteria4321
Statements (score x 3)All four conditional statements are correct.Three conditional statements are correct.Two conditional statements are correct.One conditional statement is correct.
Reasoning (score x 2)Very clear and very accurate justificationClear and accurate justificationClear justificationVague justification

Assessment

Multiple Choice. Choose the letter of the best answer and write it on a separate sheet of paper.

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

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

  1. Which of the following supports the logical equivalence ~(𝑞 → 𝑝) ∨ (𝑝 ∧ 𝑞) ⟺ ~(~𝑞 ∨ 𝑝) ∨ (𝑝 ∧ 𝑞)?

    • a. Absorption Law
    • b. Commutative Law
    • c. De Morgan’s Law
    • d. Switcheroo Law
  2. Which of the following supports the logical equivalence ~(~𝑞 ∨ 𝑝) ∨ (𝑝 ∧ 𝑞) ⟺ (𝑞 ∧ ~𝑝) ∨ (𝑝 ∧ 𝑞)?

    • a. Absorption Law and Double Negation
    • b. Commutative Law and Double Negation
    • c. De Morgan’s Law and Double Negation
    • d. Switcheroo Law and Double Negation
  3. Which of the following supports the logical equivalence (𝑞 ∧ ~𝑝) ∨ (𝑝 ∧ 𝑞) ⟺ (𝑞 ∧ ~𝑝) ∨ (𝑞 ∧ 𝑝)?

    • a. Associative Law
    • b. Commutative Law
    • c. Distributive Law
    • d. Identity Law
  4. Which of the following supports the logical equivalence (𝑞 ∧ ~𝑝) ∨ (𝑞 ∧ 𝑝) ⟺ 𝑞 ∧ (~𝑝 ∨ 𝑝)?

    • a. Distributive Law
    • b. Idempotent Law
    • c. Identity Law
    • d. Switcheroo Law
  5. Which of the following supports the logical equivalence 𝑞 ∧ (~𝑝 ∨ 𝑝) ⟺ 𝑞 ∧ 𝜏?

    • a. Absorption Law
    • b. Domination Law
    • c. Identity Law
    • d. Inverse Law
  6. Which of the following supports the logical equivalence 𝑞 ∧ 𝜏 ⟺ 𝑞?

    • a. Absorption Law
    • b. Domination Law
    • c. Identity Law
    • d. Inverse Law
  7. Which of the following logical equivalences is being depicted by 𝑝 ∧ (𝑞 ∨ 𝑟) ⟺ (𝑝 ∧ 𝑞) ∨ (𝑝 ∧ 𝑟)?

    • a. Associative Law
    • b. Commutative Law
    • c. Distributive Law
    • d. Identity Law
  8. Which of the following are logically equivalents?

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

For item numbers 10-15, refer to the conditional proposition, “If Matmat is a responsible student, then he will do his assignments”.

  1. What type of conditionals is being depicted by the conditional statement, “If Matmat does his assignments, then he is a responsible student”?

    • a. converse
    • b. contrapositive
    • c. inverse
    • d. equivalence
  2. Which of the following represents item number 10?

    • a. 𝑞 ⟶ 𝑝
    • b. 𝑝 ⟶ 𝑞
    • c. ~𝑞 ⟶ ~𝑝
    • d. ~𝑝 ⟶ ~𝑞
  3. What type of conditionals is being depicted by the conditional statement, “If Matmat does not do his assignments, then he is not a responsible student”?

    • a. converse
    • b. contrapositive
    • c. inverse
    • d. equivalence
  4. Which of the following represents item number 12?

    • a. 𝑝 ⟶ 𝑞
    • b. ~𝑝 ⟶ ~𝑞
    • c. 𝑞 ⟶ 𝑝
    • d. ~𝑞 ⟶ ~𝑝
  5. What type of conditionals is being depicted by the conditional statement, “If Matmat is not a responsible student, then he will not do his assignments”?

    • a. converse
    • b. contrapositive
    • c. inverse
    • d. equivalence
  6. Which of the following represents item number 14?

    • a. 𝑝 ⟶ 𝑞
    • b. ~𝑝 ⟶ ~𝑞
    • c. 𝑞 ⟶ 𝑝
    • d. ~𝑞 ⟶ ~𝑝
Additional Activities

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

B. Think of a conditional statement. Cite its converse, contrapositive, and inverse.

Conditional: _____ Converse: _____ Contrapositive: _____ Inverse: _____

Answer Key

What I Know
  1. c
  2. a
  3. d
  4. a
  5. b
  6. d
  7. b
  8. c
  9. b
  10. c
  11. a
  12. a
  13. c
  14. b
  15. d
What’s More
Activity 1.1

Switcheroo Law

Commutative Law

Associative Law

Inverse Law

Identity Law

Commutative Law

De Morgan’s law

Activity 1.2
  1. If I gain weight, then I eat foods high in carbohydrates.
  2. If I do not gain weight, then I do not eat foods high in carbohydrates.
  3. If I do not eat foods high in carbohydrates, then I do not gain weight.
Assessment
  1. a
  2. d
  3. c
  4. b
  5. a
  6. d
  7. c
  8. c
  9. d
  10. a
  11. a
  12. b
  13. d
  14. c
  15. b

References

General Mathematics Learner’s Material. First Edition. 2016. P. 263-269

*DepED Material: General Mathematics Learner’s Material

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: blr.lrqad@deped.gov.ph * blr.lrpd@deped.gov.ph

Leave a Reply

Your email address will not be published. Required fields are marked *

For students and teachers

Looking for a school?

Look up the enrollment, teachers, classrooms and facilities of more than 60,000 schools across the Philippines, from DepEd’s public data. Free to use.

Philippine Schools Directory by TeacherPH · every region, province, division and district