RankRizz
JEE MAIN 2023 · 31 JAN S1+4 / −1MEDIUMTRANSCRIBED

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

Consider:
S1: p⇒q∨p∧∼qp \Rightarrow q \lor p \land \sim q is a tautology.
S2: ∼p⇒∼q∧∼p∨q\sim p \Rightarrow \sim q \land \sim p \lor q is a contradiction.
Then

SOLUTION

We need to check whether S1 is a tautology and S2 is a contradiction.

p⇒(q∨p)∧(∼q)p \Rightarrow (q \lor p) \land (\sim q). Actually, let us parse with standard precedence. ∧\land binds tighter than ∨\lor, and ⇒\Rightarrow has the lowest precedence. So the expression is:

p⇒(q∨(p∧∼q))p \Rightarrow (q \lor (p \land \sim q))

Let us evaluate using a truth table approach. When p=T,q=Tp = T, q = T, the right-hand side is T∨(T∧F)=T∨F=TT \lor (T \land F) = T \lor F = T, so T⇒T=TT \Rightarrow T = T; when p=T,q=Fp = T, q = F, the right-hand side is F∨(T∧T)=F∨T=TF \lor (T \land T) = F \lor T = T, so T⇒T=TT \Rightarrow T = T; when p=F,q=Tp = F, q = T, a false premise implies anything giving TT; and when p=F,q=Fp = F, q = F, again a false premise implies anything giving TT.

S1 is TRUE for all truth values, so S1 is a tautology. Statement S1 is correct.

∼p⇒(∼q∧∼p)∨q\sim p \Rightarrow (\sim q \land \sim p) \lor q, which parses as ∼p⇒((∼q∧∼p)∨q)\sim p \Rightarrow ((\sim q \land \sim p) \lor q).

When p=Tp = T (so ∼p=F\sim p = F), a false premise implies anything, giving TT; when p=F,q=Tp = F, q = T (so ∼p=T\sim p = T), the right-hand side is (F∧T)∨T=F∨T=T(F \land T) \lor T = F \lor T = T, so T⇒T=TT \Rightarrow T = T; when p=F,q=Fp = F, q = F (so ∼p=T\sim p = T), the right-hand side is (T∧T)∨F=T∨F=T(T \land T) \lor F = T \lor F = T, so T⇒T=TT \Rightarrow T = T.

S2 is TRUE for all truth values, so S2 is also a tautology and not a contradiction, so the claim that S2 is a contradiction is wrong. Therefore, S1 is correct (it is a tautology), but S2 is incorrect (it is actually a tautology rather than a contradiction), and the correct answer is Option 4, for which only S1 is correct.

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