This is the Self-Learning Module (SLM) for General Mathematics, Quarter 2, Module 18: Tautologies and Fallacies. It is a Senior High School module, First Edition 2021, from DepEd Region 4A CALABARZON. It teaches learners to tell which compound statements are always true (tautologies) and which are always false (fallacies), and to check this with truth tables.
The module builds on earlier lessons about propositions, logical connectors, and truth tables. It also prepares learners for a later module on testing whether arguments are valid.
On this page 6 sections
What learners will learn
The module has one lesson, Lesson 1: Tautologies and Fallacies. After working through it, learners are expected to:
- illustrate different types of tautologies and fallacies; and
- apply tautologies and fallacies to real-life situations.
Tautologies: statements that are always true
A tautology is a compound statement that is true for every value of the individual statements. The module explains that the word comes from Greek: “tauto” means “same” and “logy” means “logic.”
Simple examples from the module:
- Either Mari will buy apples or Mari will not buy apples.
- My pet Yummy is healthy or he is not healthy.
- A function is a polynomial function or it is not a polynomial function.
The module lists these important laws that illustrate tautologies:
| Law | Statement |
|---|---|
| Contraposition | (p → q) ↔ (~q → ~p) |
| Reduction ad absurdum | ~(p → q) ↔ (p ∧ ~q) |
| De Morgan’s Laws | ~(p ∧ q) ↔ (~p ∨ ~q) and ~(p ∨ q) ↔ (~p ∧ ~q) |
| Modus Ponens | [(p → q) ∧ p] → q |
| Exportation | [p → (r → q)] ↔ [(p ∧ r) → q] |
| Transitivity | (p → r) ∧ (r → q) → (p → q) |
| Deduction | (p → r) ∧ [(p ∧ r) → q] → (p → q) |
Worked example: showing a statement is a tautology
The module uses this statement: “If I follow the school rules and regulations, then I am a disciplined person, but I follow the school rules and regulations, therefore I am a disciplined person.”
- Translate into symbols. Let p be “I follow school rules and regulations” and q be “I am a disciplined person.” The statement becomes [(p → q) ∧ p] → q.
- Build the truth table.
| p | q | p → q | (p → q) ∧ p | [(p → q) ∧ p] → q |
|---|---|---|---|---|
| T | T | T | T | T |
| T | F | F | F | T |
| F | T | T | F | T |
| F | F | T | F | T |
- Conclude. The last column is all true, so the statement is a tautology. It is also an example of Modus Ponens.
Fallacies: statements that are always false
A fallacy is a statement that is always false. Earlier modules called this a contradiction. This module uses the word fallacy because other sources do, and because a contradiction is one kind of logical fallacy. Examples from the module include “Twelve is an odd number,” “Cats can fly,” “A triangle has four sides,” and “Today is Monday and Tuesday.”
A fallacy can also mean a mistaken idea based on unsound reasoning. The module describes three common ones:
- Affirming the conclusion: trying to prove p → q by assuming q and proving p. Example: “Assuming that I smile to you, then I am happy to see you.”
- Denying the hypothesis: trying to prove p → q by assuming ~p and proving ~q. Example: “Assuming that I will not eat sweet foods, then I will not be a diabetic.”
- Circular reasoning: the reasoner begins with what they are trying to end with. Example: a chicken must come from an egg, but an egg cannot exist without a chicken laying it, but a chicken must come from an egg.
Worked example: showing a statement is a fallacy
The module tests “Denise loves both singing and dancing, but she loves neither dancing nor acting.” With p as singing, q as dancing, and r as acting, the statement becomes (p ∧ q) ∧ (~q ∧ ~r). The eight-row truth table gives false in every row of the final column, so the statement is a fallacy. In plain terms, Denise cannot both love dancing and not love dancing.
How to use this module
The module follows the usual SLM parts, in this order:
- What I Know: a 15-item multiple-choice pretest.
- What’s In: find the truth values of 10 propositions and show their truth tables, as a review.
- What’s New: decide whether everyday statements are always true (T) or a mistaken belief (MB), then explain two statements.
- What is It: the lesson discussion and worked examples above.
- What’s More: Activity 1.1 (tautology or fallacy?) and Activity 1.2 (build truth tables for five statements).
- What I Have Learned: fill in the key terms and explain why tautologies and fallacies matter in real life.
- What I Can Do: write your own tautology or fallacy, put it in symbols, and prove it with a truth table. It is graded by a rubric on symbols, truth table accuracy, and the proof statement.
- Assessment: a 15-item multiple-choice post-test, followed by Additional Activities where learners draw conclusions from short arguments.
Learners: write your answers on a separate sheet of paper, not on the module. Read each instruction before you start. Use the answer key only to check your own work, and be honest about it.
Parents and facilitators: help your child go through the parts in order. Ask the teacher for help if the pretest shows that the lesson is hard for them.
Teachers: the answer key covers the pretest, Activities 1.1 and 1.2, and the assessment. The rubric in What I Can Do can be used to grade the learners’ own truth tables.
Frequently asked questions
What grade and quarter is this General Mathematics module for?
It is a Senior High School General Mathematics module for Quarter 2. It is Module 18, titled Tautologies and Fallacies.
What is the difference between a tautology and a fallacy?
A tautology is a compound statement that is true for every value of its individual statements, such as “Today is Monday or today is not Monday.” A fallacy is a statement that is always false, such as “Cats can fly.”
How do you show that a statement is a tautology or a fallacy?
Translate the statement into symbols, build its truth table, and look at the final column. If every row is true, it is a tautology; if every row is false, it is a fallacy.
Does the module have an answer key?
Yes. It has answers for the pretest, Activity 1.1, Activity 1.2, and the assessment.
What are the common fallacies discussed in the module?
The module discusses affirming the conclusion, denying the hypothesis, and circular reasoning, each with an everyday example.
Full text of the module
The text below is a transcription of the PDF above, as printed.
Senior High School
General Mathematics Quarter 2 – Module 18: Tautologies and Fallacies
[illustration: students reading and studying outdoors and at a desk, with a teacher, a globe, and a lantern]
CO_Q2_General Mathematic SHS Module 18
General Mathematics Alternative Delivery Mode Quarter 2 – Module 18: Tautologies and Fallacies First Edition, 2021
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
Writers: Baby Jane B. Agudo Editors: Elizabeth D. Lalunio, Anicia J. Villaruel, Roy O. Natividad Reviewers: Jerry Punongbayan, Diosmar O. Fernandez, Celestina M. Alba, Shielamarie E. Arce, Carmela Ana A. Reforma, Rafaela M. Merle Illustrator: Hanna Lorraine Luna, Diane C. Jupiter Layout Artist: Roy O. Natividad, Sayre M. Dialola, Argie L. Ty, Glynis P. Aviles Management Team: Francis Cesar B. Bringas, Job S. Zape, Jr., Ramonito Elumbaring, Reicon C. Condes, Elaine T. Balaogan, Fe M. Ong-ongowan, Elias A. Alicaya Jr., Gregorio A. Co Jr., Gregorio T. Mueco, Herbert D. Perez, Lorena S. Walangsumbat, Jee-Ann O. Borines, Asuncion C. Ilao
Printed in the Philippines by ________________________
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 18: Tautologies and Fallacies
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
A proposition is defined earlier as a declarative sentence that is either true or false. You also learned that we can combine propositions using logical connectors. Are these compound propositions always true or always false? Think of a sentence that could never be false? How about a sentence that could never be true? To answer these questions, this module will help you identify statements that are always true or always false. This module is written for you to help you understand more, the different logical statements.
The module is composed of only one lesson:
- Lesson 1 – Tautologies and Fallacies
After going through this module, you are expected to:
- illustrate different types of tautologies and fallacies; and
- apply tautologies and fallacies to real-life situations.
What I Know
Choose the letter of the best answer. Write the chosen letter on a separate sheet of paper.
What is a proposition statement that is always true?
a. negation
b. tautology
c. fallacy
d. absoluteWhat is a proposition statement that is always false?
a. negation
b. tautology
c. fallacy
d. absoluteWhich of the following is NOT a tautology?
a. Merida is brave, or she is not brave.
b. Either you will pass the test, or you will fail on the test.
c. Today is a lucky day and tomorrow is not a lucky day.
d. John loves Math or he does not love Math.Which of the following is a tautology?
a. 𝑝 and 𝑞 are both true, thus 𝑝 ∧ 𝑞 is true.
b. 𝑝 is true and proposition 𝑞 is false, thus 𝑝 ∧ 𝑞 is true.
c. 𝑝 is false and proposition 𝑞 is true, thus 𝑝 ∧ 𝑞 is true.
d. propositions 𝑝 and 𝑞 are both false, thus 𝑝 ∧ 𝑞 is true.Which of the following is a tautology?
a. It is a sunny day or it is not both hot and sunny day.
b. It is a sunny day or it is hot and sunny day.
c. It is a sunny day and it is not both hot and sunny day.
d. It is not hot and sunny day.Which of the following statements is represented by the logical symbol of the tautology 𝑝 ∧ ∼ (p ∨ q)?
a. Beth likes Mathematics but she does not like Math and English
b. Beth likes Mathematics but she does not like Math or English
c. Beth likes Mathematics but she does not like either Math or English
d. Beth likes Mathematics nor she does not like Math or English.Let 𝑝, and 𝑞, be the propositions:
𝑝: Annie has a stomach ache.
𝑞: Annie misses the exam.
Which of the following illustrate the tautology 𝑝 ∨ ∼ (p ∧ q)?
a. Annie has a stomach ache or she misses the exam.
b. Annie has a stomach ache and she misses the exam.
c. Annie has a stomach ache or she is not both missing the exam and has a stomach ache.
d. Annie has a stomach ache and she is either missing the exam or has a stomach ache.Which of the following is a tautology?
a. [(𝑝 → 𝑞) ∧ 𝑝] → 𝑝
b. [(𝑝 → 𝑞) ∧ 𝑝] → 𝑞
c. [~(𝑝 ∧ 𝑞) ∧ (~𝑝)] → 𝑞
d. [(𝑝 ∨ 𝑞) ∧ 𝑝] → (~𝑞)Which of the following statements is a fallacy?
a. The dog is either brown, or the dog is not brown.
b. Today is a rainy day or a sunny day.
c. If today is a rainy day, then today is a hot day.
d. Today is a hot day if and only if it is a sunny day.When does 𝑝 ↔ 𝑞, become false?
a. when both 𝑝 and 𝑞 are true
b. when both 𝑝 and 𝑞 are false
c. when 𝑝 is true and 𝑞 is false
d. cannot be determinedWhich of the following truth table shows that the proposition 𝑝 → (𝑝 ∨ 𝑞) is a tautology?
a.
| 𝑝 | 𝑞 | 𝑝 ∨ 𝑞 | 𝑝 → (𝑝 ∨ 𝑞) |
|---|---|---|---|
| T | T | T | T |
| T | F | F | T |
| F | T | T | T |
| F | F | F | T |
b.
| 𝑝 | 𝑞 | 𝑝 ∨ 𝑞 | 𝑝 → (𝑝 ∨ 𝑞) |
|---|---|---|---|
| T | T | F | T |
| T | F | F | T |
| F | T | T | T |
| F | F | F | T |
c.
| 𝑝 | 𝑞 | 𝑝 ∨ 𝑞 | 𝑝 → (𝑝 ∨ 𝑞) |
|---|---|---|---|
| T | T | T | T |
| T | F | T | T |
| F | T | T | T |
| F | F | F | T |
d.
| 𝑝 | 𝑞 | 𝑝 ∨ 𝑞 | 𝑝 → (𝑝 ∨ 𝑞) |
|---|---|---|---|
| T | T | F | T |
| T | F | F | T |
| F | T | F | T |
| F | F | T | T |
- Which of the following truth table shows that the proposition (𝑝 ∧ (~𝑞)) ∧ (𝑝 ∧ 𝑞) is a fallacy?
a.
| 𝑝 | 𝑞 | ~𝑞 | (𝑝 ∧ (~𝑞)) | 𝑝 ∧ 𝑞 | (𝑝 ∧ (~𝑞)) ∧ (𝑝 ∧ 𝑞) |
|---|---|---|---|---|---|
| T | T | F | F | T | F |
| T | F | T | T | F | F |
| F | T | F | F | F | F |
| F | F | T | F | F | F |
b.
| 𝑝 | 𝑞 | ~𝑞 | (𝑝 ∧ (~𝑞)) | 𝑝 ∧ 𝑞 | (𝑝 ∧ (~𝑞)) ∧ (𝑝 ∧ 𝑞) |
|---|---|---|---|---|---|
| T | T | F | F | T | F |
| T | F | F | F | F | F |
| F | T | F | T | T | F |
| F | F | T | F | F | F |
c.
| 𝑝 | 𝑞 | ~𝑞 | (𝑝 ∧ (~𝑞)) | 𝑝 ∧ 𝑞 | (𝑝 ∧ (~𝑞)) ∧ (𝑝 ∧ 𝑞) |
|---|---|---|---|---|---|
| T | T | F | T | F | F |
| T | F | F | F | F | F |
| F | T | F | T | T | F |
| F | F | T | F | T | F |
d.
| 𝑝 | 𝑞 | ~𝑞 | (𝑝 ∧ (~𝑞)) | 𝑝 ∧ 𝑞 | (𝑝 ∧ (~𝑞)) ∧ (𝑝 ∧ 𝑞) |
|---|---|---|---|---|---|
| T | T | F | T | F | F |
| T | F | T | T | F | F |
| F | T | F | T | T | F |
| F | F | T | F | T | F |
For items 13-14, refer to this statement: Charles loves both English and Mathematics, but he loves neither English nor Filipino.
Express the statement to mathematical symbol.
a. (𝑝 ∧ 𝑞) ∧ (𝑞 ∧ 𝑟)
b. (∼ 𝑝 ∧∼ 𝑞) ∧ (𝑞 ∧ 𝑟)
c. (𝑝 ∧∼ 𝑝) ∧ (∼ 𝑞 ∧ 𝑟)
d. (𝑝 ∧ 𝑞) ∧ (∼ 𝑞 ∧∼ 𝑟)The given statement is a:
a. tautology
b. fallacy
c. both tautology and fallacy
d. neither tautology nor fallacy[transcriber’s note: in the source, choices c and d are printed on one line as “c. both tautology and fallacyd. neither tautology nor fallacy”]
Which of the following is an example of a fallacy of affirming the conclusion?
a. If I will not take a bath, then I cannot go to school.
b. If I will love you, then you will love me too.
c. Assuming that I will not study my lesson, then I will not pass the test.
d. Since I cannot buy a new laptop, then I will not attend online classes.
Lesson 1 Tautologies and Fallacies
Honesty is a value that everyone should possess but we cannot deny the fact that everything that we say is not always true, sometimes we also say false statements. In the same manner, not everything that we hear is true, and so we should analyze first what we heard before we believe it. Mathematics also plays an important role in analyzing statements, through truth tables we can check whether a statement is always true (tautology) or always false (fallacy).
You have already learned in module 16 the term tautology, which is true for every value of the two or more given statements. The contradiction is just the opposite of tautology or you can contradict the tautology statement. Finding the truth values of propositions will give you the idea if it is a tautology or a fallacy. In previous modules, you learned how to construct the truth tables of given propositions or arguments, while on this module your previous knowledge will be intensified as it applied to real-life situations. Also, in the previous module, a statement that is always false is called a contradiction, but since in other sources it is also called a fallacy, we will be using the word fallacy this time since contradiction is an example of logical fallacy. Also, the word fallacy will be used in module 20 to find the validity of the arguments. It is hoped that this module will help identify true statements or analyze statements before you accept them as true or false.
What’s In
Determine the truth value of each of the following propositions. Show the truth table of each as well.
- ~𝑝 ∧ 𝑞 where p and q are both true propositions
- 𝑝 ∨ ~𝑞 where p and q are both false propositions
- 𝑝 → 𝑞 where p is true and q is false
- 𝑝 ↔ 𝑞 where p is false and q is true
- (𝑝 → 𝑞) ∧ (𝑞 → 𝑝) where p and q are both true propositions
- (𝑝 ↔ 𝑞) ∨ 𝑞 where p and q are both false
- ~(𝑞 ∨ 𝑝) ∧ 𝑝 where p and q are both true
- 𝑝 ∧ (𝑝 ↔ 𝑞) where p is true and q is false
- 𝑝 → (𝑞 ∨ 𝑞) where p and q are both false
- ~𝑝 ∧ (𝑝 → 𝑞) where p is false and q is true.
What’s New
Now, that you already know how to perform different types of operations on propositions, I am confident that you are now ready for the new lesson.
Activity 1:
Determine whether the given statements are always true or just a mistaken belief (false statement). Write T if the statement is always true or MB if it is a mistaken belief.
- Today is Monday or today is not Monday.
- Either Nicco is smart, or he is not smart.
- If you buy a book then you will read it daily.
- Assuming that If I plant cactus, then I will get my hands dirty. Since I didn’t get my hands dirty, therefore I didn’t plant a cactus.
- If I will study my lessons every day then I will have a passing grade. But, I study my lessons every day then I will have a passing grade.
- I love you or I don’t love you.
- Since I like you, then you will like me too.
- I can comprehend the writings that I read or I cannot comprehend the writings that I read.
[transcriber’s note: the printed list goes from item 7 to item 9; no item 8 appears]
Activity 2:
Explain whether the given statement is true or false.
- If I study hard, then I will get an academic award but I will study hard. Therefore, I will get an academic award.
- Blessy loves both swimming and running, but she loves neither swimming nor running.
What is It
A tautology is a compound statement that is true for every value of the individual statements. The word tautology is derived from a Greek word where ‘tauto’ means ‘same’ and ‘logy’ means ‘logic’.
The simple examples of tautology are:
- Either Mari will buy apples or Mari will not buy apples.
- My pet Yummy is healthy or he is not healthy
- A function is a polynomial function or it is not a polynomial function.
Some important tautologies are presented below:
| Laws that illustrates tautologies | Possible Statements |
|---|---|
| Contraposition | (𝑝𝑝 → 𝑞𝑞) ↔ (~𝑞𝑞 → ~𝑝𝑝) |
| Reduction ad absurdum | ~(𝑝𝑝 → 𝑞𝑞) ↔ (𝑝𝑝 ∧ ~𝑞𝑞) |
| De Morgan’s Laws | ~(𝑝𝑝 ∧ 𝑞𝑞) ↔ ( ~𝑝𝑝 ∨ |
| Modus Ponens | [(𝑝𝑝 → 𝑞𝑞) ∧ 𝑝𝑝] → 𝑞𝑞 |
| Exportation | [𝑝𝑝 → (𝑟𝑟 → 𝑞𝑞)] ↔ [(𝑝𝑝 ∧ 𝑟𝑟) → 𝑞𝑞] |
| Transitivity | (𝑝𝑝 → 𝑟𝑟) ∧ (𝑟𝑟 → 𝑞𝑞) → (𝑝𝑝 → 𝑞𝑞) |
| Deduction | (𝑝𝑝 → 𝑟𝑟) ∧ [(𝑝𝑝 ∧ 𝑟𝑟) → 𝑞𝑞] → (𝑝𝑝 → 𝑞𝑞) |
To determine whether a given statement is a tautology, you can use the table of truth values.
Example:
If I follow the school rules and regulations, then I am a disciplined person, but I follow the school rules and regulations, therefore I am a disciplined person. Show that the given statement is a tautology.
Solution:
Step 1: Translate the given statement into symbols. Let 𝑝𝑝: I follow school rules and regulation. 𝑞𝑞: I am a discipline person. The statement can be written in symbols as [(𝑝𝑝 → 𝑞𝑞) ∧ 𝑝𝑝] → 𝑞𝑞.
Step 2: Construct the truth table of the given statements.
| 𝑝𝑝 | 𝑞𝑞 | 𝑝𝑝 → 𝑞𝑞 | (𝑝𝑝 → 𝑞𝑞) ∧ 𝑝𝑝 | [(𝑝𝑝 → 𝑞𝑞) ∧ 𝑝𝑝] → 𝑞𝑞 |
|---|---|---|---|---|
| T | T | T | T | T |
| T | F | F | F | T |
| F | T | T | F | T |
| F | F | T | F | T |
Step 3: Make a conclusion. Since the result is all true, it shows that the given statement is a tautology. Observe also, that the statement illustrates Modus Ponens.
Fallacy is a statement that is always false. (in previous modules it is also a contradiction)
Examples:
- Twelve is an odd number.
- Cats can fly.
- A triangle has four sides.
- 𝑎𝑎𝑎𝑎 = 2
- Today is Monday and Tuesday
Sometimes fallacy is also described as a mistaken idea based on unsound arguments. Some commonly used fallacies are as follows:
Affirming the conclusion – a fallacy of affirming the conclusion is incorrect reasoning in proving 𝑝𝑝 → 𝑞𝑞 by starting by assuming 𝑞𝑞 and proving 𝑝𝑝.
Example: Assuming that I smile to you, then I am happy to see you.
If you answer all the assignments, then you will learn Math.Denying the hypothesis – a fallacy of denying the hypothesis is incorrect reasoning in proving 𝑝𝑝 → 𝑞𝑞 by starting with assuming ~𝑝𝑝 and proving ~𝑞𝑞.
Example: Assuming that I will not eat sweet foods, then I will not be a diabetic.
Since I am not hungry, then I will not eat.Circular reasoning – a fallacy in which the reasoner begins with what they are trying to end with.
Example: A chicken must come from an egg.
But, an egg cannot exist without a chicken laying it.
But, a chicken must come from an egg…
Like tautology, truth table can be also used to show that a statement is a fallacy.
Example: Denise loves both singing and dancing, but she loves neither dancing nor acting.
Solution:
Step 1: Translate the given statement into symbols. Let 𝑝𝑝: Denise loves singing. 𝑞𝑞: Denise loves dancing. 𝑟𝑟: Denise loves acting. The statement can be written in symbols as (𝒑𝒑 ∧ 𝒒𝒒) ∧ (∼ 𝒒𝒒 ∧∼ 𝒓𝒓).
Step 2: Construct the truth table of the given statements.
| 𝑝𝑝 | 𝑞𝑞 | 𝑟𝑟 | ∼ 𝑞𝑞 | ∼ 𝑟𝑟 | 𝑝𝑝 ∧ 𝑞𝑞 | ∼ 𝒒𝒒 ∧∼ 𝒓𝒓 | (𝒑𝒑 ∧ 𝒒𝒒) ∧ (∼ 𝒒𝒒 ∧∼ 𝒓𝒓) |
|---|---|---|---|---|---|---|---|
| T | T | T | F | F | T | F | F |
| T | T | F | F | T | T | F | F |
| T | F | T | T | F | F | F | F |
| T | F | F | T | T | F | T | F |
| F | T | T | F | F | F | F | F |
| F | T | F | F | T | F | F | F |
| F | F | T | T | F | F | F | F |
| F | F | F | T | T | F | T | F |
Step 3: Make a conclusion. Since the result is all false, it shows that the given statement is a fallacy.
What’s More
Activity 1.1
Determine whether the statement is a tautology or fallacy.
- If today is Saturday, then tomorrow is Monday
- Assuming that I am a college degree, then I am a teacher.
- Either Joshua will buy books or Joshua will not buy books.
- If I will study hard, then I will pass the examination, but I studied hard, therefore I passed the examination
- Aldrin loves both Math and Science, but he loves neither Science nor English
Activity 1.2
Construct a truth table for each of the following to determine whether the given is a tautology or a fallacy.
- (𝑝𝑝 → 𝑞𝑞) ↔ (~𝑞𝑞 → ~𝑝𝑝)
- ~(𝑝𝑝 ∧ 𝑞𝑞) ↔ ( ~𝑝𝑝 ∨ ~𝑞𝑞)
- ~(𝑝𝑝 → 𝑞𝑞) ↔ (𝑝𝑝 ∧ ~𝑞𝑞)
- (𝑝𝑝 ∧ 𝑞𝑞) ↔ (𝑝𝑝 → ~𝑞𝑞)
- 𝑞𝑞 ∧ ~(𝑝𝑝 ∨ 𝑞𝑞)
What I Have Learned
A. Fill in the blanks with the correct term or phrase to complete the sentence.
- A _____________________ is a statement which is true for every value of the individual statements.
- _________________ is statement which is always false.
- __________________ is an incorrect reasoning in proving 𝑝𝑝 → 𝑞𝑞 by starting by assuming 𝑞𝑞 and proving 𝑝𝑝.
- __________________ is an incorrect reasoning in proving 𝑝𝑝 → 𝑞𝑞 by starting with assuming ~𝑝𝑝 and proving ~𝑞𝑞.
- ___________________ a fallacy in which the reasoner begins with what they are trying to end with.
B. How important is your knowledge about tautologies and fallacy in real-life situations?
What I Can Do
On your Own!
Make a compound statement which is either a tautology or a fallacy and write the statement in symbol. Then, construct a truth table to show that the statement given is a tautology or a fallacy.
The following rubric will be used to rate your work for each of the four problems:
| Criteria | 4 | 3 | 2 | 1 |
|---|---|---|---|---|
| Translating the statements into symbols | The statement is translated into symbols with correct logical connectors. | One of the logical connectors used is incorrect | Two of the logical connectors used are incorrect | Three or more logical connectors used are incorrect |
| Accuracy of the truth table | The truth table has complete and accurate truth values | One of the values in the truth table is incorrect | Two of the values in the truth table are incorrect | Three or more of the values in the truth table are incorrect |
| Proof statement | Consistently logical; aids clear and easy understanding of the solution | Somewhat logical; somewhat aids clear or easy understanding of the solution | Somewhat illogical; tends to complicate the understanding of the solution | No textual explanation or table of values of solution or answer. |
Assessment
Choose the letter of the best answer. Write the chosen letter on a separate sheet of paper.
Which of the following is a tautology?
- a. It is a compound statement that is always true.
- b. It is a compound statement that is not always true.
- c. It is a compound statement that is sometimes true.
- d. It is a compound statement that is neither true nor false.
Which of the following is a fallacy?
- a. It is a compound statement that is always true.
- b. It is a compound statement that is not always true.
- c. It is a compound statement that is sometimes true.
- d. It is a compound statement that is neither true nor false.
Which of the following is NOT a tautology?
- a. Maria is smart, or she is not smart.
- b. Either you will pass the interview, or you will fail in the interview.
- c. Anna loves Arts or she does not love Arts.
- d. Today is a not lucky day and tomorrow is a lucky day.
Which of the following is a tautology?
- a. [(𝑝𝑝 → 𝑞𝑞) ∧ 𝑝𝑝] → 𝑝𝑝 b. (𝑝𝑝 → 𝑞𝑞) ↔ (~𝑞𝑞 → 𝑝𝑝)
- c. [[𝑝𝑝 → (𝑟𝑟 → 𝑞𝑞)] ↔ [(𝑝𝑝 ∧ 𝑟𝑟) → 𝑞𝑞] d. (𝑝𝑝 → 𝑟𝑟) ∧ [(𝒑𝒑 ↔ 𝒓𝒓) → 𝑞𝑞] → (𝑝𝑝 → 𝑞𝑞)
Which of the following is a tautology?
- a. Michael is an artist or not an artist.
- b. Michael is an artist and a singer.
- c. It is not true that Michael is both an artist and a singer
- d. Michel is not a singer.
Which of the following statements is represented by the logical symbol of the tautology 𝑝𝑝 ∧ ∼ (p ∨ q)?
- a. Jeff likes Music but he does not like Music and Arts
- b. Jeff likes Music but he does not like Music or Arts
- c. Jeff likes Music nor he does not like Music or Arts.
- d. Jeff likes Music but he does not like either Music or Arts
Let 𝑝𝑝, and 𝑞𝑞, be the propositions:
𝑝𝑝: Ivy was absent.
𝑞𝑞: Ivy misses the review.
Which of the following illustrates the tautology 𝑝𝑝 ∨ ∼ (p ∧ q)?- a. Ivy was absent or she misses the review.
- b. Ivy was absent or she is not both missing the review and she was absent.
- c. Ivy was absent and she misses the review.
- d. Ivy was absent and she is either missing the review or she was absent
Which of the following is a NOT tautology?
- a. [(𝑝𝑝 → 𝑞𝑞) ∧ 𝑝𝑝] → 𝑝𝑝 b. (𝑝𝑝 → 𝑞𝑞) ↔ (~𝑞𝑞 → ~𝑝𝑝)
- c. [[𝑝𝑝 → (𝑟𝑟 → 𝑞𝑞)] ↔ [(𝑝𝑝 ∧ 𝑟𝑟) → 𝑞𝑞] d. (𝑝𝑝 → 𝑟𝑟) ∧ [(𝑝𝑝 ∧ 𝑟𝑟) → 𝑞𝑞] → (𝑝𝑝 → 𝑞𝑞
Which of the following statement is a fallacy?
- a. The dog is either brown, or the dog is not brown.
- b. Today is a rainy day or a sunny day.
- c. If tomorrow is Monday, then today is Saturday.
- d. Today is a hot day if and only if it is a sunny day.
Which of the following is a fallacy?
- a. (𝑝𝑝 ∧ 𝑞𝑞) ↔ (𝑝𝑝 → ~𝑞𝑞) b. (𝑝𝑝 → 𝑞𝑞) ↔ (~𝑞𝑞 → ~𝑝𝑝)
- c. [[𝑝𝑝 → (𝑟𝑟 → 𝑞𝑞)] ↔ [(𝑝𝑝 ∧ 𝑟𝑟) → 𝑞𝑞] d. (𝑝𝑝 → 𝑟𝑟) ∧ [(𝑝𝑝 ∧ 𝑟𝑟) → 𝑞𝑞] → (𝑝𝑝 → 𝑞𝑞
Which of the following truth table shows that the proposition 𝑝𝑝 ∨ (𝑞𝑞 → ~𝑝𝑝) is a tautology?
a.
| 𝑝𝑝 | 𝑞𝑞 | ~𝑝𝑝 | 𝑞𝑞 → ~𝑝𝑝 | 𝑝𝑝 ∨ (𝑞𝑞 → ~𝑝𝑝) |
|---|---|---|---|---|
| T | T | F | F | T |
| T | F | F | T | T |
| F | T | T | T | T |
| F | F | T | T | T |
b.
| 𝑝𝑝 | 𝑞𝑞 | ~𝑝𝑝 | 𝑞𝑞 → ~𝑝𝑝 | 𝑝𝑝 ∨ (𝑞𝑞 → ~𝑝𝑝) |
|---|---|---|---|---|
| T | T | F | F | T |
| T | F | F | F | T |
| F | T | T | T | T |
| F | F | T | T | T |
c.
| 𝑝𝑝 | 𝑞𝑞 | ~𝑝𝑝 | 𝑞𝑞 → ~𝑝𝑝 | 𝑝𝑝 ∨ (𝑞𝑞 → ~𝑝𝑝) |
|---|---|---|---|---|
| T | T | F | T | T |
| T | F | F | F | T |
| F | T | T | F | T |
| F | F | T | F | T |
d.
| 𝑝𝑝 | 𝑞𝑞 | ~𝑝𝑝 | 𝑞𝑞 → ~𝑝𝑝 | 𝑝𝑝 ∨ (𝑞𝑞 → ~𝑝𝑝) |
|---|---|---|---|---|
| T | T | T | F | T |
| T | F | T | T | T |
| F | T | F | T | T |
| F | F | F | T | T |
- Which of the following truth table shows that the proposition (𝑝𝑝 ∧ [(𝑞𝑞 ∨ (~𝑝𝑝)) ∧ (~𝑞𝑞)] is a fallacy?
a.
| 𝑝𝑝 | 𝑞𝑞 | ~𝑝𝑝 | ~𝑞𝑞 | (𝑞𝑞 ∨ (~𝑝𝑝)) | [(𝑞𝑞 ∨ (~𝑝𝑝)) ∧ (~𝑞𝑞)] | (𝑝𝑝 ∧ [(𝑞𝑞 ∨ (~𝑝𝑝)) ∧ (~𝑞𝑞)]) |
|---|---|---|---|---|---|---|
| T | T | F | F | F | F | F |
| T | F | F | T | F | F | F |
| F | T | T | F | F | F | F |
| F | F | T | T | T | T | F |
b.
| 𝑝𝑝 | 𝑞𝑞 | ~𝑝𝑝 | ~𝑞𝑞 | (𝑞𝑞 ∨ (~𝑝𝑝)) | [(𝑞𝑞 ∨ (~𝑝𝑝)) ∧ (~𝑞𝑞)] | (𝑝𝑝 ∧ [(𝑞𝑞 ∨ (~𝑝𝑝)) ∧ (~𝑞𝑞)]) |
|---|---|---|---|---|---|---|
| T | T | F | F | T | F | F |
| T | F | F | T | F | F | F |
| F | T | T | F | T | F | F |
| F | F | T | T | T | T | F |
c.
| 𝑝𝑝 | 𝑞𝑞 | ~𝑝𝑝 | ~𝑞𝑞 | (𝑞𝑞 ∨ (~𝑝𝑝)) | [(𝑞𝑞 ∨ (~𝑝𝑝)) ∧ (~𝑞𝑞)] | (𝑝𝑝 ∧ [(𝑞𝑞 ∨ (~𝑝𝑝)) ∧ (~𝑞𝑞)]) |
|---|---|---|---|---|---|---|
| T | T | F | F | T | F | F |
| T | F | F | T | F | F | F |
| F | T | T | F | T | F | F |
| F | F | T | T | T | T | F |
d.
| 𝑝𝑝 | 𝑞𝑞 | ~𝑝𝑝 | ~𝑞𝑞 | (𝑞𝑞 ∨ (~𝑝𝑝)) | [(𝑞𝑞 ∨ (~𝑝𝑝)) ∧ (~𝑞𝑞)] | (𝑝𝑝 ∧ [(𝑞𝑞 ∨ (~𝑝𝑝)) ∧ (~𝑞𝑞)]) |
|---|---|---|---|---|---|---|
| T | T | F | T | T | F | F |
| T | F | F | F | F | F | F |
| F | T | T | F | T | F | F |
| F | F | T | T | T | T | F |
For items 13-14, refer to this statement: Carmela loves both Badminton and Volleyball, but she loves neither Badminton nor Tennis.
Express the statement to a mathematical symbol.
- a. (𝑝𝑝 ∧ 𝑞𝑞) ∧ (𝑞𝑞 ∧ 𝑟𝑟) b. (𝑝𝑝 ∧ 𝑞𝑞) ∧ (∼ 𝑞𝑞 ∧∼ 𝑟𝑟)
- c. (𝑝𝑝 ∧∼ 𝑝𝑝) ∧ (∼ 𝑞𝑞 ∧ 𝑟𝑟) d. (∼ 𝑝𝑝 ∧∼ 𝑞𝑞) ∧ (𝑞𝑞 ∧ 𝑟𝑟)
The given statement is a:
- a. tautology b. fallacy
- c. both tautology and fallacy d. neither tautology not fallacy
Which of the following is an example of a fallacy denying the hypothesis?
- a. If I will not take a bath, then I cannot go to school.
- b. If I will love you, then you will love me too.
- c. Assuming that I will study my lesson, then I will not pass the test.
- d. Assuming that I will not go to school every day, then I will not fail.
Additional Activities
Draw a conclusion!
- If I pass the final exam, I will graduate. I graduated. Therefore…
- I will go to La Union, I will eat “Halo-Halo” de Iloko. If I eat “Halo-Halo”, I gain weight. Therefore,…
- Rachel and Paulo will be at a concert. Rachel was at the concert. Therefore,…
- If a person is an engineer, then that person has a college degree. Dennis does not have a college degree. Therefore,…
- If I am irritated or angry, I cannot concentrate. I can concentrate. Therefore,…
Answer Key
What I Know
- b
- c
- c
- a
- a
- c
- c
- b
- c
- c
- c
- a
- d
- b
- b
What’s More
Activity 1.1
- Fallacy 2. Fallacy 3. Tautology 4. Tautology 5. Fallacy
Activity 1.2
[transcriber’s note: the column headers of the truth tables are printed as scattered formula fragments that cannot be reliably ordered, so the header cells are marked [illegible]. The T/F rows are transcribed as printed.]
[transcriber’s note: first truth table of Activity 1.2]
| [illegible] | [illegible] | [illegible] | [illegible] | [illegible] | [illegible] | [illegible] |
|---|---|---|---|---|---|---|
| T | T | F | F | T | T | T |
| T | F | T | F | F | F | T |
| T | T | F | T | T | T | F |
| T | T | T | T | T | F | F |
Since the result is all true, it shows that the given statement is a tautology.
[transcriber’s note: second truth table of Activity 1.2]
| [illegible] | [illegible] | [illegible] | [illegible] | [illegible] | [illegible] | [illegible] | [illegible] |
|---|---|---|---|---|---|---|---|
| T | F | F | F | F | T | T | T |
| T | T | T | F | T | F | F | T |
| T | T | F | T | T | F | T | F |
| T | T | T | T | T | F | F | F |
Since the result is all true, it shows that the given statement is a tautology.
[transcriber’s note: third truth table of Activity 1.2]
| [illegible] | [illegible] | [illegible] | [illegible] | [illegible] | [illegible] | [illegible] |
|---|---|---|---|---|---|---|
| T | F | F | F | T | T | T |
| T | T | T | T | F | F | T |
| T | F | F | F | T | T | F |
| T | F | T | F | T | F | F |
Since the result is all true, it shows that the given statement is a tautology.
[transcriber’s note: fourth truth table of Activity 1.2]
| [illegible] | [illegible] | [illegible] | [illegible] | [illegible] | [illegible] |
|---|---|---|---|---|---|
| F | F | T | F | T | T |
| F | T | F | T | F | T |
| F | T | F | F | T | F |
| F | T | F | T | F | F |
Since the result is all false, it shows that the given statement is a fallacy.
[transcriber’s note: fifth truth table of Activity 1.2]
| [illegible] | [illegible] | [illegible] | [illegible] | [illegible] |
|---|---|---|---|---|
| F | F | T | T | T |
| F | F | T | F | T |
| F | F | T | T | F |
| F | T | F | F | F |
Since the result is all false, it shows that the given statement is a fallacy.
Assessment
- a
- b
- d
- c
- a
- d
- b
- a
- c
- a
- a
- b
- b
- a
- d
References
Oronce, Orlando. A. General Mathematics. Quezon City: Rex Bookstore, Inc., 2016. Pp. 304-319
DepEd BLR (2016). General Mathematics, first ed., DepEd Philippines
Tautology in Math. https://tutors.com/math-tutors/geometry-help/tautology-inmath-definition-examples
Byjus the learning app. https://byjus.com/maths/tautology/
Quipper Tautologies and Fallacy https://link.quipper.com/en/organizations/5468bd782294ee08a80000ec/curriculum
The FoundationsL Logic and proofshttps://faculty.nps.edu/rgera/current_classes/MA2025/Section1.6.pdf
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