Scribd
Upload
15 views9 pages

Lec 5

Uploaded by

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

Lec 5

Uploaded by

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

Discrete mathematics

Lecture- 05

Propositional Logic(Part-3)
❑ Tautologies: A Tautology is a formula which is always true for every
value of its propositional variables.
Example: Prove that the statement (p ⟶ q) (￢ q⟶ ￢ p) is a tautology.

p q p⟶q ￢p ￢q ￢q⟶￢p (p ⟶ q) (￢ q⟶ ￢ p)
T T T F F T T
T F F F T F T
F T T T F T T
F F T T T T T

As the final column contains all True, so it is a tautology.


Example: Find out, this expression (p ∧ ￢q) ∨ (p ∨ q) is Tautology or not.
Practice problem:

▪ Show that (p → q) ∧ (q → r) → (p → r) is a tautology.


▪ Show that (p ∨ q) ∧ (¬p ∨ r) → (q ∨ r) is a tautology.
▪ Show that (p → q) → r and p → (q → r) is a tautology.
▪ Show that (p ∧ q) → r and (p → r) ∧ (q → r) is a tautology.
▪ Determine whether (¬q ∧ (p → q))→¬p is a tautology.
Contradictions: A Contradiction is a formula which is always false for
every value of its propositional variables.
Example − Prove (A ∨ B) ∧ [(¬A) ∧ (¬B)] is a contradiction.
The truth table is as follows −

As we can see every value of (A ∨ B) ∧ [(¬A) ∧ (¬B)] is “False”,


it is a contradiction.
Practice problem:

o Show that (p → q) ∧ (q → r) → (p → r) is a contradiction or not.


o Show that (p ∨ q) ∧ (¬p ∨ r) → (q ∨ r) is a contradiction or not.
o Show that (p → q) → r and p → (q → r) is a contradiction or not.
o Show that (p ∧ q) → r and (p → r) ∧ (q → r) is a contradiction or not.
o Determine whether (¬q ∧ (p → q))→¬p is a contradiction or not.
Contingency: A Contingency is a formula which has both some true and
some false values for every value of its propositional variables.
Example − Prove (A∨B)∧(¬A) a contingency.
The truth table is as follows −

As we can see every value of (A∨B)∧(¬A) has both “True” and


“False”, it is a contingency.
The End

You might also like