Scribd
Upload
16 views21 pages

Ex 1.3 Propositional Equivalences

Uploaded by

hafizmuhammadzainulabideen.99
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
16 views21 pages

Ex 1.3 Propositional Equivalences

Uploaded by

hafizmuhammadzainulabideen.99
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/ 21

CC1041

Discrete Mathematics
course mentor
Seher Ansar Khawaja
[email protected]

National College of Business Administration and Economics main


campus, Lahore, Pakistan
Sec 1.3
Propositional
Equivalences
Tautology

 A compound proposition that is always true, no


matter what the truth values of the propositional
variables that occur in it, is called a tautology.

 p ∨ ¬p is always true, it is a tautology.


Contradiction

 A compound proposition that is always false is


called a contradiction.

 p ∧ ¬p is always false, it is a contradiction.


Contingency

 A compound proposition that is neither a


tautology nor a contradiction is called a
contingency.

 P v ¬q
Class Activity

 Use truth table to show that [(p → q) ∧ p]→q is a


tautology.
 Use truth table to show that (p ∧ ~q) ∧(~p ∨ q) is
a contradiction.
Logically Equivalent

 Compound propositions that have the same truth


values in all possible cases are called logically
equivalent.
 The compound propositions p and q are called
logically equivalent if p ↔ q is a tautology.
The notation p ≡ q denotes that p and q are
logically equivalent.
 ≡ is logically equivalent sign
Example

 Show that p → q and ¬p ∨ q are logically


equivalent.
Example
 Show that p ∨ (q ∧ r) and (p ∨ q) ∧ (p ∨ r) are logically equivalent.
This is the distributive
law of disjunction over conjunction.
Class Activity

 Show that ¬(p ∨ q) and ¬p ∧ ¬q are logically


equivalent.
Class Activity

 Show that ¬(p ∨ q) and ¬p ∧ ¬q are logically


equivalent.
De-Morgan Law
Convert using De Morgan Law

Use De Morgan’s laws to find the negation


 Ali is fat and wealthy
 Negation according to de Morgan law is
“Ali is not fat or not wealthy”
 Ahmed will go to Lahore or Karachi
 Negation according to de Morgan law is
“Ahmed will not go to Lahore and not go to
Karachi”
Class Activity

 Use De Morgan’s laws to find the negation


 Ibrahim is smart and hard working.
 Ahmed support Peshawar Zalmi or Karachi Kings
Show that ￢ (p → q) and p ∧ ￢ q are logically equivalent.
We have the following equivalences.

 ￢ (p → q) ≡ ￢ ( ￢ p ∨ q) by p → q ≡ ￢ p ∨ q

 ≡ ￢ ( ￢ p)∧ ￢ q by the second De Morgan


law
 ≡ p ∧￢q by the double negation law
Practice Problems
Q: 1,5,6,7,9,16,17,22,23,24,30

You might also like