UGC-NET | UGC-NET CS 2017 Nov – III | Question 57

Let P, Q, R and S be Propositions.
Assume that the equivalences P ⇔ (Q ∨ ¬ Q) and Q ⇔ R hold.
Then the truth value of the formula (P ∧ Q) ⇒ ((P ∧ R) ∨ S) is always:
(A) True
(B) False
(C) Same as truth table of Q
(D) Same as truth table of S


Answer: (A)

Explanation:

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.