RankRizz
JEE MAIN 2020 · 04 SEP S1+4 / −1EASYTRANSCRIBED

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

Given the following two statements:
(S1)(S_1) : (q∨p)→(p↔∼q)(q \vee p) \to (p \leftrightarrow \sim q) is a tautology
(S2)(S_2) : ∼q∧(∼p↔q)\sim q \wedge (\sim p \leftrightarrow q) is a fallacy. Then:

SOLUTION

Let us first write clearly what every symbol means. The symbol ∨\vee stands for “or”, ∧\wedge for “and”, ∼\sim for “not”, →\to for “if … then …”, and ↔\leftrightarrow for “if and only if” (biconditional). A statement is a tautology when it is true for every possible truth-value assignment of its component variables, while it is a fallacy when it is false for every assignment.

We have two compound statements:

S1:  (q∨p)→(p↔∼q)S_1 :\;(q \vee p) \to (p \leftrightarrow \sim q)

S2:  ∼q∧(∼p↔q)S_2 :\;\sim q \wedge (\sim p \leftrightarrow q)

To test whether S1S_1 is a tautology, we enumerate all possible truth-values of pp and qq. There are four possibilities: (p,q)=(T,T), (T,F), (F,T), (F,F).(p,q) = (T,T),\,(T,F),\,(F,T),\,(F,F). For every pair we shall compute each sub-expression step by step.

Case 1: p=T,  q=Tp=T,\;q=T

First, q∨p=T∨T=T.q \vee p = T \vee T = T.

Next, ∼q=∼T=F,\sim q = \sim T = F, so p↔∼q=T↔F=Fp \leftrightarrow \sim q = T \leftrightarrow F = F because a biconditional is true only when both sides have the same truth value.

Finally, (q∨p)→(p↔∼q)=T→F=F,(q \vee p) \to (p \leftrightarrow \sim q) = T \to F = F, since “true implies false” is false.

Case 2: p=T,  q=Fp=T,\;q=F

Here, q∨p=F∨T=T.q \vee p = F \vee T = T.

Also, ∼q=∼F=T,\sim q = \sim F = T, hence p↔∼q=T↔T=T.p \leftrightarrow \sim q = T \leftrightarrow T = T.

Thus (q∨p)→(p↔∼q)=T→T=T.(q \vee p) \to (p \leftrightarrow \sim q) = T \to T = T.

Case 3: p=F,  q=Tp=F,\;q=T

We obtain q∨p=T∨F=T.q \vee p = T \vee F = T.

Further, ∼q=∼T=F,\sim q = \sim T = F, so p↔∼q=F↔F=T.p \leftrightarrow \sim q = F \leftrightarrow F = T.

Consequently, (q∨p)→(p↔∼q)=T→T=T.(q \vee p) \to (p \leftrightarrow \sim q) = T \to T = T.

Case 4: p=F,  q=Fp=F,\;q=F

Now q∨p=F∨F=F.q \vee p = F \vee F = F.

Whenever the antecedent of an implication is false, the whole implication is automatically true, because F→X=TF \to X = T for any XX. Therefore we do not even need to calculate the biconditional; still, for completeness we note ∼q=T\sim q = T and p↔∼q=F↔T=F.p \leftrightarrow \sim q = F \leftrightarrow T = F. The implication is F→F=T.F \to F = T.

Collecting the truth values of S1S_1 we have: F,  T,  T,  T.F,\;T,\;T,\;T. Because one row (the very first) gives false, S1S_1 is not a tautology. So statement S1S_1 is incorrect.

Next we examine S2=∼q∧(∼p↔q)S_2 = \sim q \wedge (\sim p \leftrightarrow q) to see whether it is a fallacy. Again we test all four assignments.

Case 1: p=T,  q=Tp=T,\;q=T

Compute ∼q=F.\sim q = F.

Compute ∼p=F,\sim p = F, so ∼p↔q=F↔T=F.\sim p \leftrightarrow q = F \leftrightarrow T = F.

Hence ∼q∧(∼p↔q)=F∧F=F.\sim q \wedge (\sim p \leftrightarrow q) = F \wedge F = F.

Case 2: p=T,  q=Fp=T,\;q=F

We get ∼q=T.\sim q = T.

Also ∼p=F,\sim p = F, and ∼p↔q=F↔F=T.\sim p \leftrightarrow q = F \leftrightarrow F = T.

Therefore ∼q∧(∼p↔q)=T∧T=T.\sim q \wedge (\sim p \leftrightarrow q) = T \wedge T = T. This row gives true.

Case 3: p=F,  q=Tp=F,\;q=T

Here ∼q=F.\sim q = F.

Then ∼p=T,\sim p = T, and ∼p↔q=T↔T=T.\sim p \leftrightarrow q = T \leftrightarrow T = T.

Thus ∼q∧(∼p↔q)=F∧T=F.\sim q \wedge (\sim p \leftrightarrow q) = F \wedge T = F.

Case 4: p=F,  q=Fp=F,\;q=F

Now ∼q=T.\sim q = T.

Also ∼p=T,\sim p = T, giving ∼p↔q=T↔F=F.\sim p \leftrightarrow q = T \leftrightarrow F = F.

Hence ∼q∧(∼p↔q)=T∧F=F.\sim q \wedge (\sim p \leftrightarrow q) = T \wedge F = F.

The truth values obtained for S2S_2 are F,  T,  F,  F.F,\;T,\;F,\;F. Because at least one row (the second) is true, the statement is not always false; therefore it is not a fallacy. Hence statement S2S_2 is also incorrect.

We have shown that S1S_1 is not a tautology and S2S_2 is not a fallacy. Thus both statements asserted in the question are wrong.

Hence, the correct answer is Option A.

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