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

Answer

By the rules of negation of biconditional,
~(p ↔ q) ≡ (p ∧ ~q) ∨ (q ∧ ~p)
∴ ~ [(p ∧ ~ q) ∨ (q ∧ ~p)] ≡ p ↔ q
∴ ~(p ∧ ~q) ∧ ~(q ∧ ~p) ≡ p ↔ q … (Negation of disjunction)
≡ p ↔ q ≡ ~(p ∧ ~ q) ∧ ~ (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