Scribd
Upload
94 views

Constructing A Truth Table

This document provides an overview of constructing truth tables to evaluate compound propositions in propositional logic. It defines basic logical operations like negation, conjunction, disjunction, conditionals, biconditionals. Examples are given of truth tables for these operations. The key concepts of tautology, contradiction and contingency are also explained based on whether the proposition is true, false or contingent for all possible truth value assignments. Practice exercises are included to construct truth tables for various compound propositions.

Uploaded by

Hazel Nantes
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
94 views

Constructing A Truth Table

This document provides an overview of constructing truth tables to evaluate compound propositions in propositional logic. It defines basic logical operations like negation, conjunction, disjunction, conditionals, biconditionals. Examples are given of truth tables for these operations. The key concepts of tautology, contradiction and contingency are also explained based on whether the proposition is true, false or contingent for all possible truth value assignments. Practice exercises are included to construct truth tables for various compound propositions.

Uploaded by

Hazel Nantes
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

CONSTRUCTING A

TRUTH TABLE
A truth table displays the
relationship between all
possible truth values of the
component propositions and
the compound propositions
of the former.
Truth Table for a Negation

Let p be a proposition.

p p
T F
F T
Give the truth value of each statement.
1. 2 is not odd.
F
 (2 is odd.)
Ans. T
2. It is not the case that 49 is a perfect
square.
T
 (49 is a perfect square.)
Ans. F
4
Let p and q be Truth Table for a Conjunction
propositions.
p q pq
If both p and q
are true, then the T T T
compound T F F
proposition is
true. False if F T F
otherwise. F F F

5
Give the truth value of each statement.
T T
1. 2 is prime and 2 is even.
Ans. T
T F
2. 3 is odd and 5 is even

Ans. F
F (Whatever!) T or F
3. 7 is even and I am handsome.

Ans. F 6
Let p and q be
propositions. Truth Table for a Disjunction

If at least one of p q pq


p or q is true, T T T
then the
T F T
compound
proposition is F T T
true. False if F F F
otherwise.
Remember:

or is inclusive when it means


“either or both”.
or is exclusive when it means
“either but not both”.
In logic, or is always inclusive.

8
Give the truth value of each statement.
T T
1. 3 is odd or 4 is even.
Ans. T
T (Whatever!) T or F
2. 4 is even or I am handsome.
Ans. T
F F
3. 6 is odd or 5 is even.
Ans. F 9
The conditional Truth Table for a Conditional
proposition p q p→q
if p then q T T T
(denoted by p → q)
T F F
is true except when
p is true and q is F T T
false. F F T

10
Give the truth value of each statement.
T T
1. If 2 is even then 3 is odd.
Ans. T
T F
2. If 4 is even then 5 is even.
Ans. F

11
Give the truth value of each statement.
F T
3. If 2 is odd then 4 is even.
Ans. T
F F
4. If 4 is odd then 5 is even.
Ans. T

12
Remember:
A conditional proposition is a
proposition joined by the words
if and then.
Form: If p then q.
p is called the antecedent,
while q is called the
consequent.
13
A biconditional
proposition Truth Table for a Biconditional
has the form
p if and only if q. p q pq
The proposition p if T T T
and only if q
(denoted by p  q) is T F F
true if p and q have F T F
the same truth
values. It is false F F T
otherwise.
14
Give the truth value of each statement.

T T
1. 4 is even iff 5 is odd.
Ans. T
T F
2. 2 is even iff 4 is odd.
Ans. F

15
Give the truth value of each statement.

F T
3. 4 is odd iff 2 is even.
Ans. F
F F
4. 2 is odd iff 5 is even.
Ans. T

16
Type of Compound Symbolic Hint
Proposition Form
p
negation just write the
q opposite
conjunction (and) pq only T T is T
disjunction (or) pq at least one T to be T
conditional p→q only T F is F
biconditional pq T T and F F are T
If 2 propositions There will be 4
are involved, for 22 = 4 rows for the truth
example p and q. values.

If 3 propositions There will be 8


are involved, for 23 = 8 rows for the truth
example p, q and r. values.
Example 1: Construct the Truth Table of
(p  q)  (~p  q)
p q pq ~p ~p  q (p  q)  (~p  q)

T T T F T T
T F T F F T

F T T T T T
F F F T T T
tautology

A tautology is a compound proposition that


is true for all possible truth values of
its component propositions.
Example 2: (p  ~q)  (p  q)

p q ~q (p  ~q) (p  q) (p  ~q)  (p  q)

T T F F T F
T F T T F F

F T F F F F
F F T F F F
contradiction

A contradiction is a compound proposition that


is false for all possible truth values of
its component propositions.
Example 3: Construct the Truth Table of
(p → q) ↔[~p  (p  q)]
p q p → q ~p p  q ~p  (p  q) (p → q) ↔[~p  (p  q)]

T T T F T F F

T F F F T F T

F T T T T T T
F F T T F F F
Example 4: (p  ~q) → r
p q r ~q p  ~q (p  ~q) → r
T T T F F T
T T F F F T
T F T T T T
T F F T T F
F T T F F T
F T F F F T
F F T T F T
F F F T F T
contingency

A contingency is a compound proposition that


is neither tautology nor a contradiction.
Practice Exercises
Construct a truth table for the following compound
propositions and indicate if it is a tautology, a
contradiction or a contingency.
1. ~p  (q  ~r)
2. p  [(q  ~p)  ~q]
3. (p → q) ↔ (~q → ~p)
4. (p → q)  (~p → r)
Practice Exercises
Construct a truth table for the following
compound propositions and indicate if it is
a tautology, a contradiction or a
contingency.
5. (p → q) → (~p  q)
6. p → [q ↔ (p  q)]
7. [(p  q)  (~p  q)] → p
Do mathematics
to learn mathematics.
Practice.
Improve.
Stay curios.
Keep safe.
Stay healthy.
God bless you!

You might also like