Scribd
Upload
9 views25 pages

MAT Lecture 6 Truth Tables

Uploaded by

khotso.tsatsi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views25 pages

MAT Lecture 6 Truth Tables

Uploaded by

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

C5-MAT-20

MATHEMATICS
Lecture-7

Truth Tables
Objectives of today’s class:
Tautology
Contradiction
Inverse
Converse
Contrapositive
Converse
For a given the conditional statement p→q, we can write
the converse statement by interchanging or swapping the roles of
the hypothesis and conclusion of the original conditional statement.
Therefore, the converse is the implication q→p.
Example:
– If it is raining, then the home team wins.
If the home team wins then it is raining
– If it snows tonight, then I will stay at home
If I stay home tonight then there is snow
Inverse
The inverse of a conditional statement is formed by negating the
hypothesis and negating the conclusion of the original statement. In
other words, the word "not" is added to both parts of the sentence.
If p  q is a statement then the inverse is ~p  ~q
Example:
– “If it is raining, then the home team wins.”
If it is not raining, then the home team does not win
– If it snows tonight, then I will stay at home
If it does not snow tonight, then I will not stay at home
Contrapositive
The contrapositive of a conditional statement is formed by
negating both the hypothesis and the conclusion, and
then interchanging the resulting negations.
In other words, the contrapositive negates and switches the parts of the
sentence. It does BOTH the jobs of the INVERSE and the
CONVERSE.
If p  q is a statement then the contrapositive is ~q  ~p
Example:
– “If it is raining, then the home team wins.”
If the home team does not win, then it is not raining
– If it snows tonight, then I will stay at home
If I do not stay home tonight then it there is no snow
Truth table for Converse, Inverse and Contrapositive:
Tautology
A tautology is a compound statement (premise and conclusion) that always produces
truth. A proposition P is a tautology if it is true under all circumstances. It means it
contains the only T in the final column of its truth table.
If p is a proposition, then tautology is defined as “p ∨ ~p”
The simple examples of tautology are;
•Either Mohan will go home or Mohan will not go home.
•He is healthy or he is not healthy
•A number is odd or a number is not odd.
Example: Prove that the statement (p⟶q) ↔(∼q⟶∼p) is a tautology.

Solution: Make the truth table of the above statement:


As the final column contains all T's, so it is a tautology.
p q p→q ~q ~p ~q⟶∼p (p→q)⟷( ~q⟶~p)
T T T F F T T
T F F T F F T
F T T F T T T

F F T T T T T
Contradiction
A contradiction is a compound statement (premise and conclusion) that
always produces false. A proposition P is a contradiction if it is false
under all circumstances. It means it contains the only F in the final
column of its truth table.
If p is a proposition, then contradiction is defined as “p ∧ ~p”
Example: Show that the statement p ∧∼p is a contradiction.
Solution:
p ∼p p ∧∼p

T F F

F T F
Contingency
A Contingency is a formula which has both some true and some
false values for every value of its propositional variables.
Example: Show that statement (p →q)⟶ (p∧q ) is a contingency

p q p →q p∧q (p →q)⟶ (p∧q )

T T T T T

T F F F T

F T T F F

F F T F F
Logical Equivalence

Two statements are logically equivalent provided that they have exactly
the same truth values in all possible cases. In other words, their columns
on a truth table are identical. If p and q are logically equivalent, we can
represent this symbolically as “p⇔q

Example: Show that PQ and ~P V Q are logically equivalent


Axioms/Laws of Logical propositions

Idempotent laws
• pp p
• ppp

Associative laws
(a) (pq) r  p (qr)
(b) (p  q)  r  p  (q  r)

Commutative laws
•pq  qp
•p  q  q  p
Distributive laws
•p(qr)  (pq)(pr)
•p(qr)  (pq) (p  r)

Identity laws
•p0p
•p11
•p1p
•p00
Complement laws
•p~p  1
•p~p  0
•~~p  p
•~1 0
•~0 1

DeMorgan’s Laws

•~(p  q)  ~p ~q

•~(p  q)  ~p  ~q
Evaluating the propositions using the axioms:
1) Write the following sentences in symbolic form using p and q
p =“He is tall”, q = “He is handsome”

•He is tall and handsome


•He is tall but not handsome
•It is false that he is short or handsome
•He is neither tall nor handsome
•He is tall, or he is short and handsome
Solution:
•(p∧q)
•(p∧~q)
•(~(~p ∨ q))
•(~p V~ q)
•(p ∨(~p ∧ q)
2) Let p = “It is cold” and Let q = “It is raining”.
Give a simple verbal sentence which describes each of the following
statements:
•~p
•p∧q
•p ∨ q
•q ∨ ~p
•~p ∨ ~q
• ~~ q
Solution:
•It is not cold
•It cold and raining
•It is cold or it is raining
•It is raining or it is not cold
•It is not cold or it is not raining
•It is not true that it is not raining
Simplify each proposition by using the axioms:
•p ∨ p ∧ q
•~ (p ∨ q) ∨ ( ~p ∧ q)

Solution:
p ∨ p ∧ q = (p ∧ 1) ∨ (p ∧ q) identity axiom
= p ∧ ( 1 ∨ q) distributive axiom
=p∧1 identity axiom
=p identity axiom

Solution:
~ (p ∨ q) ∨ ( ~p ∧ q) = (~p ∧ ~q) ∨ (~p ∧ q) Demorgan’s law
= ~p ∧ (~q ∨ q) Distributive law
= ~p ∧ 1 Complement law
= ~p Identity law
•Determine the Inverse, converse and contrapositive of each statement:
If he has courage he will win
Only if he does not tire will he win

•Find

(a) Contrapositive of p~q


(b) Contrapositive of ~pq
(c) Contrapositive of the converse of p~q
(d) Converse of the contrapositive of ~p~q
Excercises:
•Verify that the propositions are tautologies:
a.p ∨ ~(p∧q)
b.(p∧q) ∨ ~(p∧q)
c.(p→q)⟷( ~q⟶~p)
d.(p ∨ q) ∧ (¬p) ∧ (¬q)
e.(x ⇒ y) ∨ (y ⇒ x)

•Verify the propositions are contradictions:


~(x ⇒ y) ∨ (y ⇒ x)
(p∧q) ∧ ~(p ∨ q)
•Prove that the propositions are logical equivalent

1) p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
2) (p ∨ q) ≡ (~p ∧ ~ q)
3) (p → q) ∧ (q → p) ≡ p ↔ q.
Thank you!

You might also like