The proposition (~ p) ∨ (p∧~q) is equivalent to
(A) p ∧ ~q
(B) p ∨ ~q
(C) p → ~q
(D) q → p
This can be explained with the help of the following truth tables (‘∧’ symbol stands for AND and ‘∨’ symbol stands for OR):
Thus from the truth table, we conclude that (~ p) ∨ (p∧~q) is equivalent to p → (~q).
