Question
Using rules in logic, prove the following : ~p ∧ q ≡ (p ∨ q) ∧ ~p

Answer

(p ∨ q) ∧ ~ p
≡ (p ∧ ~p) ∨ (q ∧ ~p) … (Distributive Law)
≡ F ∨ (q ∧ ~p) … (Complement Law)
≡ q ∧ ~ p … (Identity Law)
≡ ~p ∧ q …(Commutative Law)
∴ ~p ∧ q ≡ (p ∨ q) ∧ ~p.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free