RankRizz
JEE MAIN 2020 · 05 SEP S2+4 / −1EASYTRANSCRIBED

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

The statement (p→(q→p))→(p→(p∨q))(p \to (q \to p)) \to (p \to (p \vee q)) is:

SOLUTION

We have to decide the logical nature of the formula S=(p→(q→p))→(p→(p∨q)).S=(p\to(q\to p))\to(p\to(p\vee q)).

First, we recall the standard implication-disjunction equivalence:

a→b  ≡  ∼a  ∨  b.a\to b\;\equiv\;\sim a\;\vee\;b.

We apply this rule to the innermost implication q→p.q\to p.

So, q→p  ≡  ∼q  ∨  p.q\to p\;\equiv\;\sim q\;\vee\;p.

Substituting this result back into the left part of SS we get

p→(q→p)  ≡  p→(∼q∨p).p\to(q\to p)\;\equiv\;p\to(\sim q\vee p).

Once again using the same rule a→b≡∼a∨ba\to b\equiv\sim a\vee b on the implication whose antecedent is pp, we have

p→(∼q∨p)  ≡  ∼p  ∨  (∼q  ∨  p).p\to(\sim q\vee p)\;\equiv\;\sim p\;\vee\;(\sim q\;\vee\;p).

Now we re-arrange the disjunction because disjunction is associative and commutative:

∼p  ∨  (∼q  ∨  p)  =  (∼p  ∨  p)  ∨  ∼q.\sim p\;\vee\;(\sim q\;\vee\;p)\;=\;(\sim p\;\vee\;p)\;\vee\;\sim q.

We know that the law of excluded middle tells us ∼p  ∨  p≡True.\sim p\;\vee\;p\equiv \text{True}. Therefore,

(∼p  ∨  p)  ∨  ∼q  ≡  True  ∨  ∼q  ≡  True.(\sim p\;\vee\;p)\;\vee\;\sim q\;\equiv\;\text{True}\;\vee\;\sim q\;\equiv\;\text{True}.

Hence, the whole sub-formula p→(q→p)p\to(q\to p) is always true; it is a tautology. We can now write

p→(q→p)  ≡  True.p\to(q\to p)\;\equiv\;\text{True}.

Next, we turn to the right part of SS, namely p→(p∨q).p\to(p\vee q). Again we use a→b≡∼a∨b.a\to b\equiv\sim a\vee b. So,

p→(p∨q)  ≡  ∼p  ∨  (p∨q).p\to(p\vee q)\;\equiv\;\sim p\;\vee\;(p\vee q).

Associating the disjunctions yields

∼p  ∨  p  ∨  q.\sim p\;\vee\;p\;\vee\;q.

By the law of excluded middle, ∼p  ∨  p≡True,\sim p\;\vee\;p\equiv\text{True}, hence

∼p  ∨  p  ∨  q  ≡  True  ∨  q  ≡  True.\sim p\;\vee\;p\;\vee\;q\;\equiv\;\text{True}\;\vee\;q\;\equiv\;\text{True}.

Therefore, the consequent (p→(p∨q))(p\to(p\vee q)) is also a tautology. We can thus rewrite SS purely in terms of truth values:

S  ≡  (True)  →  (True).S\;\equiv\;(\text{True})\;\to\;(\text{True}).

Finally, we know that True→True≡True,\text{True}\to\text{True}\equiv\text{True}, because an implication with a true antecedent and a true consequent is true.

So the entire statement SS is always true for every possible truth-value assignment of pp and qq. That is, SS is a tautology.

Hence, the correct answer is Option 4.

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