RankRizz
JEE MAIN 2021 · 26 AUG S2+4 / −1EASYTRANSCRIBED

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

Consider the two statements:
(S1):(p→q)∨(∼q→p)(S_1) : (p \rightarrow q) \vee (\sim q \rightarrow p) is a tautology.
(S2):(p∧∼q)∧(∼p∨q)(S_2) : (p \wedge \sim q) \wedge (\sim p \vee q) is a fallacy.
Then:

SOLUTION

We have to examine two logical sentences.

First consider S1:(p→q)  ∨  (∼q→p).S_1 : (p \rightarrow q)\;\vee\;(\sim q \rightarrow p).

Before simplifying, we recall the basic implication equivalence:
For any propositions aa and b,b, the implication a→ba \rightarrow b is equivalent to ∼a  ∨  b.\sim a \;\vee\; b.

Applying this rule to each implication inside S1,S_1, we get

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

So S1S_1 becomes

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

Using the associative and commutative laws of ∨,\vee, we may regroup and list all literals together:

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

Now, by the law of excluded middle, ∼p  ∨  p=T\sim p \;\vee\; p = \text{T} (always true).
Also, q  ∨  q=q.q \;\vee\; q = q.

Hence

(∼p  ∨  p)  ∨  (q  ∨  q)=T  ∨  q=T.(\sim p \;\vee\; p)\;\vee\;(q \;\vee\; q)=\text{T}\;\vee\; q=\text{T}.

Because the disjunction reduces to the constant true value T,\text{T}, the formula is true for every possible truth assignment of pp and q.q. Therefore S1S_1 is indeed a tautology.

Now we examine S2:(p∧∼q)  ∧  (∼p∨q).S_2 : (p \wedge \sim q)\;\wedge\;(\sim p \vee q).

For this conjunction to be true, both parts must be true simultaneously.

Start with the left conjunct p∧∼q.p \wedge \sim q. For it to be true we must have

p=Tandq=F.p = \text{T} \quad\text{and}\quad q = \text{F}.

With these same truth values, evaluate the right conjunct ∼p∨q.\sim p \vee q. Since p=T,p=\text{T}, we have ∼p=F;\sim p=\text{F}; and with q=F,q=\text{F}, we obtain

∼p∨q=F∨F=F.\sim p \vee q = \text{F} \vee \text{F} = \text{F}.

Thus, whenever the first conjunct is true, the second conjunct is forced to be false, making the whole conjunction false. No other truth assignment can make the first conjunct true, so there is no assignment that makes the entire expression true.

Therefore the statement (p∧∼q)  ∧  (∼p∨q)(p \wedge \sim q)\;\wedge\;(\sim p \vee q) is always false; it is a fallacy. Hence the meta-statement S2S_2 saying “this formula is a fallacy” is true.

We have established that S1S_1 is a tautology (true) and S2S_2 correctly asserts a fallacy (so S2S_2 is also true). Therefore, both statements are true.

Hence, the correct 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