Scribd
Upload
30 views16 pages

12 Truth Tables

Uploaded by

mallarikrstn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as KEY, PDF, TXT or read online on Scribd
30 views16 pages

12 Truth Tables

Uploaded by

mallarikrstn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as KEY, PDF, TXT or read online on Scribd
You are on page 1/ 16

Truth Tables

Mathematics in the Modern World


JERALDO C. SO
Master Teacher I
Lesson Objective
At the end of the lesson, the students must be
able to determine the truth values of
proposition.
Types of Statements and their
Connective Symbols
Conjunctions
The connective AND implies the idea of
“both.” For the conjunction p ∧ q to be true,
both p and q must be true.
Sample for Conjunctions
Let p represent “7 > 5” and let q represent “12
<
0.” Find the truth value of p and q
Solution
The statement 7 > 5 is true. Hence, p is true. The
statement 12 < 0 is false. Hence, q is false. The
second row of the conjunction truth table shows
that p ∧ q is false
Disconjunctions
If Rowan says that he has been reading or
writing, then he is telling the truth if he has
been reading and not writing. Likewise, he is
telling the truth when he has been writing and
not reading. Also, he is telling the truth when
he
has been reading and also writing. Table 2
shows
the truth table for disjunction. The use of or in
this case is called the inclusive or (inclusive
disjunction
Sample
Let p befor Disconjuctions
“I will clean the kitchen.” Let q be “I
will
clean the bathroom.” Form the inclusive
disjunction of p and q and discuss its truth
values.
Solutio
n statement, “I will clean the kitchen or I
The
will clean the bathroom” is the required
disjunction. It will be false only if both
components are false and will be true
otherwise.
Negation
If P is a simple proposition, then P is either
true
or false but not both. That is, if P is a true
statement, then its truth value is true and if P
is
false, then its truth value is false
Sample for Negations
Construct a truth table of
a. ~(P ∧ Q) b. ~(P ∨ Q) c. ~(P ∧ ~Q)
Solution
a. ~(P ∧
Q)
Solution for Negations
b. ~(P ∨ Q)
Solution for Negations
c. ~(P ∧ ~Q)
Truth Tables for Conditional and
Biconditional
P →Q is false only when P is true and Q is
false; otherwise, it is true.
Sample
Find the truth value of each statement.
a. If 3 + 3 = 9, then 33 = 6.
b. If 3 + 3 = 6, then 12 = 7.
c. If 5 is a whole number, then 7 is a real
number.
Solution
a. Let P represent “3 + 3 = 9,” and Q represent
“33 = 6.” Since 3 + 3 = 9 is false and 33 = 6 is
false, then P → Q is true.
b. Let P represent “3 + 3 = 6,” and Q represent
“12 = 7.” Since 3 + 3 = 6 is true and 12 = 7 is
false, then P→Q is false.
c. Let P represent “5 is a whole number,” and Q
represent “7 is a real number.” Since
“5 is a whole number” is true and “7 is a real
number” is true, then P→Q is true
Exercise A
True or False.
1. A conditional (→) is true in all cases except
when the antecedent is true and the
consequent is false.
2. A conjunction (∨) is only true when both
components are false.
3. A disjunction (∧) is true unless both
components are true.
4. A biconditional (↔) is true when both
components have the same truth value.
5. A negation (~) changes the value of the
statement to its opposite.
Exercise B
Construct a truth table for each statement.
1. ~(p ∨ q) 6. p ∨ q → ~q
2. ~(~p ∧ ~q) 7. ~p ∧ ~p → ~(p ∧ q)
3. p ∧ ~q 8. P Q ∧ R
4. ~p ∨ ~q 9. (P ∨ ~Q) (P Q)
5. q ∨ (~p ∧ q) 10. (P ~Q) ∨ (~P ∨ Q)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy