RankRizz
JEE MAIN 2020 · 09 JAN S2+4 / −1EASYTRANSCRIBED

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

If p→(p∧∼q)p \to (p \wedge \sim q) is false, then the truth values of pp and qq are respectively:

SOLUTION

We are told that the proposition p→(p∧∼q)p \to (p \wedge \sim q) is false.

First, we recall the fundamental rule for a material implication. The compound statement A→BA \to B is false only in the single case when the antecedent AA is true and the consequent BB is false. Symbolically,

A→B=F    iff    A=T and B=F.A \to B = F \;\; \text{iff} \;\; A = T \text{ and } B = F.

In our problem, the antecedent is pp and the consequent is p∧∼q.p \wedge \sim q. So, for the whole implication to be false, we must have

p=Tand(p∧∼q)=F.p = T \quad\text{and}\quad (p \wedge \sim q) = F.

We already know from the first part that

p=T.p = T.

Now we must analyze the conjunctive statement p∧∼q.p \wedge \sim q. A conjunction X∧YX \wedge Y is true only when both XX and YY are true; otherwise it is false. Here,

X=p,Y=∼q.X = p, \qquad Y = \sim q.

We have just found p=T.p = T. Let us substitute this known value:

p∧∼q=T∧∼q.p \wedge \sim q = T \wedge \sim q.

We are told that this entire conjunction is actually false:

T∧∼q=F.T \wedge \sim q = F.

The only way an expression of the form T∧YT \wedge Y can be false is when the second factor YY is false. Hence,

∼q=F.\sim q = F.

A negation ∼q\sim q is false precisely when the original statement qq is true. Therefore,

q=T.q = T.

Collecting our results, we have obtained

p=T,q=T.p = T, \qquad q = T.

This matches Option C, which lists the truth values as T,T.T, T.

Hence, the correct answer is Option 3.

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