Question: ~(p?q)?(~ p?q) ? ~p Prove using Logical Equivalences using laws. Theorem 2.1.1 Logical Equivalences Given any statement variables p, q, and r, a tautology t

~(p?q)?(~ p?q) ? ~p

Prove using Logical Equivalences using laws.

~(p?q)?(~ p?q) ? ~p Prove using Logical
Theorem 2.1.1 Logical Equivalences Given any statement variables p, q, and r, a tautology t and a con hold. 1. Commutativeiaws: pAQEqu 2. Associative laws: (p A q) A r E p A (q A r) 3. Distributive laws: p A (q v r) E (p A q) v (p A r) 4. Identity laws: p A t E p 5. Negation laws: p v ~p E t 6. Double negative law: ~(~p) E p 7. Idempotent laws: p A p E p 8. Universal bound laws: p v t E t 9. De Morgan's laws: ~(p A q) a p v ~q 10. Absorption laws: p v (p A q) E p l 1. Negations of t and c: ~t E

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!