Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Engineering Mathematics Mathematical Logic Propositional Equivalence
Let P, Q, R and S be Propositions. Assume that the equivalences \(P\leftrightarrow(Q \vee \;\neg\; Q)\) and \(Q \leftrightarrow R\) hold. Then the truth value of the formula \(\left( {P \wedge Q} \right) \Rightarrow \left( {\left( {P \wedge R} \right) \vee S} \right)\) is always:
1
True
2
False
3
Same as truth table of Q
4
Same as truth table of S