InterviewSolution
Saved Bookmarks
| 1. |
If (p ∧ ~q) ∧ (~q ∧ q) is(a) a contradiction(b) a tautology(c) neither a tautology nor a contradiction (d) both a tautology and a contradiction |
|
Answer» Correct option (a) a contradiction Explanation: (p ∧ ~q) ∧ (~p ∧ q) ≡ (p ∧ ~p) ∧ (~q ∧ q) ≡ (f ∧ f) ≡ f (f → false) (By using associative laws and commutative laws) (p ∴ ~q) ∧ (~p ∧ q) is a contradiction. |
|