Prove the given expresslon Isa tautology by developing a serles of logical eguivalence to demonstrate that It Is logically equivalent to T. [pA (p-
Prove the given expresslon Isa tautology by developing a serles of logical eguivalence to demonstrate that It Is logically equivalent to T. [pA (p- a)- q p v (q v q) by associative law (pa q) - q by identity law -p vT by negation law [F v (p a q)) + q by negation law I by domination law pv (-q v q) by associative law (p v -g) v q by De Morgan's law [o A (p- q)) - q = [p A (-p v q)- equivalence - q by logical (Pn q) - q = [-p v (p- q)] v q by logical equivalence [(P A p) v (p A q)) - q by distributive law [p A (p - q)) - 9 [(-p v p) a (p v -q)] v q by distributive law (pa q) - q= -(p A q) vq by logical equivalence
Step by Step Solution
3.45 Rating (158 Votes )
There are 3 Steps involved in it
Step: 1
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started