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

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

Among the statements:
S1: p∨q⇒r⇔p⇒rp \vee q \Rightarrow r \Leftrightarrow p \Rightarrow r
S2: p∨q⇒r⇔p⇒r∨q⇒rp \vee q \Rightarrow r \Leftrightarrow p \Rightarrow r \vee q \Rightarrow r

SOLUTION

Step 1: Understand the Logical Equivalence Rules

The standard logical identity for an implication with a disjunction (OR) in its antecedent is given by:

(p∨q)⇒r≡(p⇒r)∧(q⇒r)(p \vee q) \Rightarrow r \equiv (p \Rightarrow r) \wedge (q \Rightarrow r)

Step 2: Analyze Statement S1

S1:((p∨q)⇒r)⇔(p⇒r)S1: ((p \vee q) \Rightarrow r) \Leftrightarrow (p \Rightarrow r)

Let us construct a counterexample using truth values to see if this is a tautology:

- Let p=Falsep = \text{False}

- Let q=Trueq = \text{True}

- Let r=Falser = \text{False}

Evaluate LHS: (p∨q)⇒r(p \vee q) \Rightarrow r

- p∨q=False∨True=Truep \vee q = \text{False} \vee \text{True} = \text{True}

- True⇒False=False\text{True} \Rightarrow \text{False} = \text{False}

Evaluate RHS: p⇒rp \Rightarrow r

- False⇒False=True\text{False} \Rightarrow \text{False} = \text{True}

Since LHS=False\text{LHS} = \text{False} and RHS=True\text{RHS} = \text{True}, their bi-conditional equivalence (⇔\Leftrightarrow) evaluates to False\text{False}.

Therefore, S1S1 is not a tautology.

Step 3: Analyze Statement S2

S2:((p∨q)⇒r)⇔((p⇒r)∨(q⇒r))S2: ((p \vee q) \Rightarrow r) \Leftrightarrow ((p \Rightarrow r) \vee (q \Rightarrow r))

Using our known logical identity from Step 1, the true distribution rule uses an AND (∧\wedge) operator, not an OR (∨\vee) operator. Let us test with another counterexample:

- Let p=Truep = \text{True}

- Let q=Falseq = \text{False}

- Let r=Falser = \text{False}

Evaluate LHS: (p∨q)⇒r(p \vee q) \Rightarrow r

- p∨q=True∨False=Truep \vee q = \text{True} \vee \text{False} = \text{True}

- True⇒False=False\text{True} \Rightarrow \text{False} = \text{False}

Evaluate RHS: (p⇒r)∨(q⇒r)(p \Rightarrow r) \vee (q \Rightarrow r)

- p⇒r=True⇒False=Falsep \Rightarrow r = \text{True} \Rightarrow \text{False} = \text{False}

- q⇒r=False⇒False=Trueq \Rightarrow r = \text{False} \Rightarrow \text{False} = \text{True}

- False∨True=True\text{False} \vee \text{True} = \text{True}

Since LHS=False\text{LHS} = \text{False} and RHS=True\text{RHS} = \text{True}, their bi-conditional equivalence (⇔\Leftrightarrow) evaluates to False\text{False}.

Therefore, S2S2 is also not a tautology.

Conclusion:

Neither (S1) nor (S2) is a tautology.

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