DISCRETE
MATHEMATICS
TOPIC :EQUIVALENCE
IMPLICATIONS
NAME : HINDU ANDEM
ROLL NO : 23B81A05HL
Logical Equivalence
• Two propositions u and v are said to be logically
equivalent whenever
u and v have the same truth value.
⇔
p q ¬p (p → q) (¬p ∨ q)
• Symbol used 0 0 1 1 1
• Eg: (p → q) ⇔ (¬p ∨ q)
0 1 1 1 1
1 0 0 0 0
1 1 0 1 1
• Eg: [(p ∨ q) ∧ (¬ p ∨ ¬ q) ] ⇔ p ∧ ∨ ⊻ →
⊻q
¬ ↔
Logical Equivalence contd.,
p q ¬p ¬q (p ∨ q) (¬p ∨ (p ∨ q) ∧ (¬ p p ⊻
¬q) ∨ ¬ q) q
0 0 1 1 0 1 0 0
0 1 1 0 1 1 1 1
1 0 0 1 1 1 1 1
1 1 0 0 1 0 0 0
∧ ∨ ⊻ →
• Eg: [p ∧ (¬ q ∨ r) ] ⇔ [p ∨ (q ∧
¬ ↔
¬r) ]
Logical Equivalence contd.,
p q r ¬ q (¬ q ∨ r) p ∧ (¬ q ∨ ¬r (q ∧ ¬r) p ∨ (q ∧
r) ¬r)
0 0 0 1 1 0 1 0 0
0 0 1 1 1 0 0 0 0
0 1 0 0 0 0 1 1 1
0 1 1 0 1 0 0 0 0
1 0 0 1 1 1 1 0 1
1 0 1 1 1 1 0 0 1
1 1 0 0 0 0 1 1 1
1 1 1 0 1 1 0 0 1
¬ ∧ ∨ ⊻ → ↔
i. (p ∨ p) ⇔ p
Laws of
1. Law of double
⇔p
¬ ¬ p Logic 6. Idempotent
ii. (p ∧ p) ⇔ p
negation Laws
i. ¬ (p ∨ q) ⇔ ¬p ∧ ¬q i. (p ∨ F) ⇔ p
ii. ¬ (p ∧ q) ⇔ ¬p ∨ ¬q ii. (p ∧ T) ⇔ p
2. DeMorgan’s
7. Identity Laws
i. (p ∧ q) ⇔ (q ∧ p) i. (p ∨ ¬p) ⇔ T
Laws
ii. (p ∨ q) ⇔ (q ∨ p) ii. (p ∧ ¬p) ⇔ F
3. Commutative
8. Inverse Laws
i. p ∨ (q ∨ r) ⇔ (p ∨ q ) ∨ r 9. Domination i. (p ∨ T) ⇔ T
Laws
ii. p ∧ (q ∧ r) ⇔ (p ∧ q ) ∧ ii. (p ∧ F) ⇔ F
4. Associative
i. p ∨ (p ∧ q )⇔ p
Laws Laws
r
i. p ∨ (q ∧ r) ⇔ (p ∨ q ) ∧ (p ∨ r ii. p ∧ (p ∨ q ) ⇔ p
10. Absorption
5. Distributive Laws
ii. p ∧Important
(q ∨ r) ⇔ (p ∧ q ) ∨p(p→∧qr ⇔ ¬ p ∨ q
Laws )
)
¬ ∧ ∨ ⊻ → ↔
• Let x be a specific number. Write the negation of the following conditional.
“if x is not a real number, then it is not a rational number and not an
irrational number”
¬ (¬p →( ¬q ∧ ¬r)) ⇔ ¬ (¬ ¬ p ∨ (¬q ∧ ¬r))
Solution
⇔ ¬ ( p ∨ (¬q ∧ ¬r)) (using law of double
Let
p: x is a real number
⇔ ¬p ∧ ¬(¬q ∧ ¬r)
q: x is a rational number negation)
r: x is an irrational number (using
⇔ ¬ p ∧ (¬ ¬q ∨ ¬ ¬r) (using DeMorgan’s
The given statement can be symbolically DeMorgan’s Law)
¬p →( ¬q ∧ ¬r)
represented as
⇔ ¬ p ∧ (q ∨ r)
Law)
We need to find ¬ (¬p →( ¬q ∧ ¬r))
(law of double
¬ (¬p →( ¬q ∧ ¬r)) is
negation)
“x is not a real number and it is a rational number or an
irrational number”
¬ ∧ ∨ ⊻ → ↔
1. Prove the following logical equivalences without using truth tables.
i. p ∨ [p ∧ (p ∨ q) ] ⇔ p
ii. [p ∨ q ∨ (¬ p ∧ ¬ q ∧ r) ] ⇔ (p ∨ q ∨ r)
iii.[(¬ p ∨ ¬ q) → (p ∧ q ∧ r) ] ⇔ p ∧ q
Compulsorily you have to use laws of logic to solve
¬ ∧ ∨ ⊻ → ↔
Solution i:
To prove that, p ∨ [p ∧(p ∨ q) ] ⇔ p
p ∨ [ p ( p ∨ q) ]
∧
⇔ p ∨[ p ---- Absorption
⇔
] law
p ---- Idempotent
Law
To prove that, [p ∨ q ∨ (¬ p ∧ ¬ q ∧ r) ] ⇔ (p ∨ q
Solution ii:
∨ r)
[(p ∨ q) ∨ (¬ p ∧ ¬ q ∧ r) ]
⇔ [(p ∨ ∨ ∨
∧
q) (¬ (p
⇔ [ P ∨ ( Q ∧ rDeMorgan’s
q) r) ] -----
i. p ∨ (q ∧ r) ⇔ (p ∨ q ) ∧ (p ∨
⇔ [ ( P ∨ Q ) ∧(p( P r∨) ] - - - Distributive
) ] Law – eq(1) L e t P = 5. Distributive
∨ ii. p ∧ (q ∨ r) ⇔ (p ∧ q ) ∨ (p ∧
q ) Law a n- eq(2) r)
Q P = (p ∨ q )= a n d Q¬ = ¬ ( p( p∨ q ) i ∨
d Laws
Substituting n eq (2) r)
⇔ [ {( p ∨ q ) ∨ ¬ ( p ∨ q ) } ∧ ( p ∨ q ∨ r ) ] 8. Inverse Laws i. (p ∨ ¬p) ⇔ T
q) , eq ( 1 ) b e c o m e s
ii. (p ∧ ¬p) ⇔ F
⇔ [ T ∧ (p ∨ q ∨ r ) ] - - - - Inverse Law
i. (p ∨ F) ⇔ p
⇔ (p ∨ q ∨ r ) - - - - Identity Law 7. Identity Laws
ii. (p ∧ T) ⇔ p
Exercise
iii. [(¬ p ∨ ¬ q) → ( p ∧ q ∧ r) ] ⇔ p ∧ q
iv. [(p ∨ q) ∧ ( p ∨ ¬ q)] ∨ q ⇔ p ∨q
Prove that ( p → q) ∧ [( ¬ q ∧ ( r ∨ ¬ q)] ⇔ ¬ ( q ∨ p)
→ q) ∧ [ ( ¬ q ∧ ( r ∨ ¬ q)]
Solution:
⇔ ( p → q) ∧ [ ( ¬ q ∧ ( ¬ q ∨ r ) ] -- - Commutative
(p
⇔ ( p → q) ∧ ¬ q - - - - - - - - - - - - - - - - - - - -
Law
⇔ ( ¬p ∨ q) ∧ ¬ q - - - - - - - - - - - - - - - - - - Fact p
Absorption Law
→q⇔ ¬p∨ q
⇔ ¬ q ∧ ( ¬p ∨ q) - - - - - - - - - - - - - - - - -
⇔ ( ¬ q ∧ ¬p) ∨ ( ¬ q ∧ q) - - - - - - - - -
Commutative Law
⇔ ( ¬ q ∧ ¬p) ∨ F - - - - - - - - - - - - - - - - - - Inverse
Distributive Law
Prove that [ ¬p ( ¬ q ∧ r ) ] ∨ ( q ∧ r) ( p ∧ r) ⇔ r
∧ ∨
( q ∧ r ) ] ∨ ( q ∧ r) ( p ∧ r)
Solution:
∨
[ ¬p
∧
¬
⇔ ( q ∧ r ) ] ∨ (r ∧ q) ∨( r ∧ p) - - - - - Commutative Law
⇔ [ ¬( p ∨ ¬q ) ∧ r ] ∨ r ∧ ( q ∨ p) - - - - - - - - - - - - - -
[ ¬p
⇔ [∧r ∧ ¬( p ∨Lawq ) ] ∨ [r
⇔ A =∧ ¬( p∧∨¬qq) and
) ∧r B] =∨( p(r∨(∧q) p q) ( r ∧ p) - - - - - Associative ∨ q)]Law
Distributive
⇔ [ r ∧ A] ∨ [ r ∧ B ] ∨
Let [(¬p
⇔ [r¬(∧p[ ∨A q∨)B ∧] -r- -]- -∨- - -(r- - - - ∧ - - -∨
- - -r- - ∧
-------------
Substituting A = ¬(p ∨ q ) and B = (p( ∨ q) in the above equation
- Commutative
- - -q) Law
- - -p)
- - -------------- Distributive
DeMorgan’s Law
Law
⇔ ∧ [ ¬(p ∨ q ) ∨ (p ∨ q) ] ⇔ ∧
⇔
r r T
--------------- Inverse Law r --------------
Identity Law
Prove that
[(p∨ q) ∧ ¬ { ¬p ∧ ( ¬ q ∨ ¬r ) } ] ∨ ( ¬ p ∧ ¬q ) ∨ ( ¬ p ∧
¬r )
is a tautology without using truth tables.
Solution:
To prove that
[ ( p ∨ q) ∧ ¬ { ¬p ∧ ( ¬ q ∨ ¬r ) } ] ∨ ( ¬ p ∧ ¬q ) ∨ ( ¬ p ∧ ¬r ) = T
[(p∨ q) ∧ ¬ { ¬ p ∧ ( ¬q ∨ ¬ r )} ] ∨ ( ¬p ∧ ¬ q) ∨ ( ¬p ∧ ¬ r)
⇔ [ ( p ∨ q ) ∧ ¬ { ¬ p ∧ ¬ ( q ∧ r) } ] ∨ ( ¬ p ∧ ¬ q ) ∨ ( ¬ p ∧ ¬ r )
----- DeMorgan’s Law
⇔ [ ( p ∨ q) ∧ {¬ ¬p ∨ ¬ ¬ ( q ∧ r )} ] ∨ (¬ p ∧ ¬q ) ∨ (¬ p ∧ ¬r )
----- DeMorgan’s Law
⇔ [ ( p ∨ q ) ∧ { p ∨ ( q ∧ r) } ] ∨ ( ¬ p ∧ ¬ q ) ∨ ( ¬ p ∧ ¬ r )
-----
⇔
⇔ ∨ (( q ∧ q) ∧ r )] ∨ (¬ p ∧ ¬q ∨ ( ¬ p ∧ ¬ r ) - - - - - - - - - - - - - Associative Law
Law of Double Negation
∨ (q ∧ ( q ∧ r )) ] ∨ ( ¬ p ∧ ¬ q ∨ ( ¬ p ∧ ¬ r ) - - - - - - - - - - - - Distributive Law
p )
⇔ ∨ (q ∧ r )] ∨ (¬ p ∧ ¬q ) ∨ (¬ ∧ ¬ r ) - - - - - - - - - - - - - Idempotent Law
[ p )
p p
⇔
[[ p
∨ (q ∧ r ) ] ∨ ¬ (p ∨ q ) ∨ ( p ∨ r ) - - - - - - - - - - - - - DeMorgan’s Law
⇔ ∨ (q ∧ r )] ∨ ¬ [ (p ∨ q ) p ∨ r ) ] - - - - - - - - - - - - - DeMorgan’s
[ ¬
∧
[ p (
Law
⇔ u=
Let p [ ∨p( q∨ ∧
( qr ∧) r ) ] ∨ ¬ [ ( p ∨ ( q ∧ r ) ] - - - - - - - - - - - - - Distributive Law
⇔ [ p ∨ (q ∧ r )] ¬ [ (p ∨ ( q r ) ] ⇔ u ∨ ¬u ⇔ T - - - - - - - - Inverse Law
∨ ∧
