RankRizz
JEE MAIN 2023 · 29 JAN S1+4 / −1EASYTRANSCRIBED

JEE Main 2023 Mathematics question — Logical connectives, truth tables and tautologies

If p,qp, q and rr are three propositions, then which of the following combination of truth values of pp, qq and rr makes the logical expression {(p∨q)∧((¬p)∨r)}→((¬q)∨r)\{(p \vee q) \wedge ((\neg p) \vee r)\} \to ((\neg q) \vee r) false?

SOLUTION

To determine the truth values of pp, qq, and rr that make the logical expression false, let's analyze the implication.

The given expression is:

{(p∨q)∧(¬p∨r)}→(¬q∨r)\{(p \lor q) \land (\neg p \lor r)\} \to (\neg q \lor r)

Let the premise be A=(p∨q)∧(¬p∨r)A = (p \lor q) \land (\neg p \lor r)and the conclusion be B=¬q∨rB = \neg q \lor r.

The expression is of the form A→BA \to B.

An implication A→BA \to B is false if and only if the premise AA is True and the conclusion BB is False.

Step 1: Make the (BB) False

We need B=¬q∨rB = \neg q \lor r to be False.

For a logical OR (∨\lor) to be false, both of its components must be false.

¬q\neg q must be False   ⟹  \impliesq is True

rr must be False   ⟹  \implies r is False

So, we have established that q=Trueq = True and r=Falser = False.

Step 2: Ensure the premise (AA) is True

We need A=(p∨q)∧(¬p∨r)A = (p \lor q) \land (\neg p \lor r) to be True.

Substitute the known values (q=Trueq = \text{True}, r=Falser = \text{False}) into the premise:

p∨q=p∨True=Truep \lor q = p \lor \text{True} = \text{True}(since qq is True, the OR statement is True regardless of pp)

¬p∨r=¬p∨False=¬p\neg p \lor r = \neg p \lor \text{False} = \neg p

For the premise AA to be True, both parts of the AND (∧\land) statement must be True.

True∧¬p\text{True} \land \neg p must be True.

This means ¬p\neg p must be True, which implies p is False .

Conclusion

The combination of truth values that makes the given logical expression false is:

p=Falsep = \text{False}

q=Trueq = \text{True}

r=Falser = \text{False}

Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicLogical connectives, truth tables and tautologies
TypeMultiple choice