LOGIC

Constructing truth
table
 LOGICAL OPERATORS SYMBOL Solution:
Not p ┐p
p and q 𝑝˄𝑞
p or q 𝑝˅𝑞
if p then q 𝑝→𝑞
p if and only if q 𝑝↔𝑞 p q (𝑝 → 𝑞) (𝑞 → 𝑝).
T T T T
Example: T F F T
Let p and q be propositions. Construct F T T F
the truth table of the compound ,F F T T
proposition (𝑝 → 𝑞) ˄ (𝑞 → 𝑝).
 (𝑝 → 𝑞) ˄ (𝑞 → 𝑝).
p q (p→ q) (𝑞 → 𝑝)
T T T T
T F F T
F T T F
F F T T

P Q (p → q) (q → p) (𝑝 → 𝑞) ˄ (𝑞 → 𝑝)
T T T T T
T F F T F
F T T F F
F F T T T
2. Construct a truth table for the
proposition 𝑝 → (𝑝 ˅ 𝑞). -Tautology, Contradictions, Contingencies

- A compound proposition that is always true, no

matter what the truth values of the propositions
that occur in it is called a tautology.
p q (𝑝 ˅ 𝑞) 𝑝 → (𝑝 ˅ 𝑞) - - A compound proposition that is always false is
T T T T called a contradiction. .
- - A proposition that is neither a tautology nor a
T F T T
contradiction is a contingency.
F T T T
F F F T
Examples:
- A simple tautology is 𝑝 ˅ ¬ p
- A simple contradiction is 𝑝 ˄ ¬ p

p ¬p 𝑝˅¬p p ¬p 𝑝˄¬p
T F T T F F
T F T T F F
F T F .
T T F
F T T F T F

TAUTOLOGY CONTRADICTION
Example: - (𝑝 ˄ (¬ 𝑞)) ˄ (𝑝 ˄ 𝑞)
- (𝑝 ˄ 𝑞) → 𝑝

Solution for (𝑝 ˄ (¬ 𝑞)) ˄ (𝑝 ˄ 𝑞)

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
Example: - (𝑝 ˄ (¬ 𝑞)) ˄ (𝑝 ˄ 𝑞)
- (𝑝 ˄ 𝑞) → 𝑝

Solution for (𝑝 ˄ 𝑞) → 𝑝
p q (𝑝 ˄ 𝑞) (𝑝 ˄ 𝑞) → 𝑝

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

F F
F T
Activity ASS;
Direction: In a piece of paper perform
p q ¬𝑝 ¬q (q(¬ 𝑝)) (p
what is ask in the problems and
always be honest to yourself.
Determine the truth values of the
following propositions.

1.(𝑝 ˄ 𝑞) → (𝑝 ˄ 𝑞)
2. ((𝑝 → 𝑞) ˄ 𝑝) → ¬p
3. ((𝑝 → 𝑞) ˄ (¬ 𝑞)) → ¬ 𝑝
4. ((𝑝 ↔ 𝑞) ˅ 𝑞
5. ((𝑝 ˅ 𝑞) ˄ (¬ 𝑝)) → 𝑞
THANK YOU 
Prepared By:
Ms. Camille C. Recarro
THANK YOU 