Question: Show that p- (ng) and(p-9)^(p-1) are logically equivalent by developing a series of logical equwlences. TABLE 6 Logical Equivalences. Equivalence PAT=p PVF =p PVT=T Name
Show that p- (ng) and(p-9)^(p-1) are logically equivalent by developing a series of logical equwlences. TABLE 6 Logical Equivalences. Equivalence PAT=p PVF =p PVT=T Name Identity laws Domination laws PAF=F pvpap PAPP Idempotent laws -(-p) =P Double negation law Commutative laws pvq=qp PAqqAp Associative laws Distributive laws (pvq) vrupvar) () h (4) PV (q) = (pv) (p Vr) palavr) =(PxG) V (PAN (p Aq) -pv4) PV ( PP De Morgan's laws Absorption laws PAPVqp Chap
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
