RankRizz
JEE MAIN 2023 · 01 FEB S2+4 / −1EASYTRANSCRIBED

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

Which of the following statements is a tautology?

SOLUTION

We need to determine which of the given statements is a tautology (always true regardless of the truth values of pp and qq).

Option A: p→(p∧(p→q))p \to (p \wedge (p \to q))

When p=T,q=Fp = T, q = F: p→q=Fp \to q = F, so p∧F=Fp \wedge F = F, and T→F=FT \to F = F. Not a tautology.

Option B: (p∧q)→(¬p→q)(p \wedge q) \to (\neg p \to q)

Let us check all cases:

p=T,q=Tp = T, q = T: (T∧T)→(F→T)=T→T=T(T \wedge T) \to (F \to T) = T \to T = T ✓

p=T,q=Fp = T, q = F: (T∧F)→(F→F)=F→T=T(T \wedge F) \to (F \to F) = F \to T = T ✓

p=F,q=Tp = F, q = T: (F∧T)→(T→T)=F→T=T(F \wedge T) \to (T \to T) = F \to T = T ✓

p=F,q=Fp = F, q = F: (F∧F)→(T→F)=F→F=T(F \wedge F) \to (T \to F) = F \to F = T ✓

All cases give TRUE. This is a tautology!

Option C: (p∧(p→q))→¬q(p \wedge (p \to q)) \to \neg q

When p=T,q=Tp = T, q = T: (T∧T)→F=T→F=F(T \wedge T) \to F = T \to F = F. Not a tautology.

Option D: p∨(p∧q)p \vee (p \wedge q)

When p=F,q=Fp = F, q = F: F∨F=FF \vee F = F. Not a tautology.

The correct answer is Option B: (p∧q)→(¬p→q)(p \wedge q) \to (\neg p \to q).

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