RankRizz
JEE MAIN 2021 · 22 JUL S1+4 / −1MEDIUMTRANSCRIBED

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

Which of the following Boolean expressions is not a tautology?

SOLUTION

We need to identify which Boolean expression is NOT a tautology. Recall that p⇒q≡∼p∨qp \Rightarrow q \equiv \sim p \vee q.

Option A: (p⇒q)∨(∼q⇒p)≡(∼p∨q)∨(q∨p)≡(∼p∨p)∨q≡T∨q≡T(p \Rightarrow q) \vee (\sim q \Rightarrow p) \equiv (\sim p \vee q) \vee (q \vee p) \equiv (\sim p \vee p) \vee q \equiv T \vee q \equiv T. This is a tautology.

Option B: (q⇒p)∨(∼q⇒p)≡(∼q∨p)∨(q∨p)≡(∼q∨q)∨p≡T∨p≡T(q \Rightarrow p) \vee (\sim q \Rightarrow p) \equiv (\sim q \vee p) \vee (q \vee p) \equiv (\sim q \vee q) \vee p \equiv T \vee p \equiv T. This is a tautology.

Option C: (p⇒∼q)∨(∼q⇒p)≡(∼p∨∼q)∨(q∨p)≡(∼p∨p)∨(∼q∨q)≡T∨T≡T(p \Rightarrow \sim q) \vee (\sim q \Rightarrow p) \equiv (\sim p \vee \sim q) \vee (q \vee p) \equiv (\sim p \vee p) \vee (\sim q \vee q) \equiv T \vee T \equiv T. This is a tautology.

Option D: (∼p⇒q)∨(∼q⇒p)≡(p∨q)∨(q∨p)≡p∨q(\sim p \Rightarrow q) \vee (\sim q \Rightarrow p) \equiv (p \vee q) \vee (q \vee p) \equiv p \vee q. When p=Fp = F and q=Fq = F, this equals FF. So this is NOT a tautology.

The answer is Option D.

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