RankRizz
JEE MAIN 2019 · 08 APR S2+4 / −1MEDIUMTRANSCRIBED

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

Which one of the following statements is not a tautology?

SOLUTION

First, recall the definition: a statement (propositional formula) is called a tautology if it evaluates to True\text{True} for every possible assignment of truth-values to its constituent propositions.

Let us examine each option by constructing its complete truth table. Because we have two simple propositions, pp and qq, there are exactly four possible ordered pairs (p,q)(p,q), namely (T,T),  (T,F),  (F,T),  (F,F).(T,T),\;(T,F),\;(F,T),\;(F,F). We shall evaluate each compound statement row by row.

Option A is   (p∨q)  →  (p∨∼q).\;(p \lor q)\;\rightarrow\;(p \lor \sim q). We compute step by step.

We have

pqp∨q∼qp∨∼qTTTFTTFTTTFTTFFFFFTT\begin{array}{|c|c||c|c||c|} \hline p & q & p\lor q & \sim q & p\lor\sim q \\ \hline T & T & T & F & T \\ \hline T & F & T & T & T \\ \hline F & T & T & F & F \\ \hline F & F & F & T & T \\ \hline \end{array}

Now, the implication A→BA\rightarrow B is false only when AA is TT and BB is FF. Introducing one extra column for the entire statement, we get

pqp∨q∼qp∨∼q(p∨q)→(p∨∼q)TTTFTTTFTTTTFTTFFFFFFTTT\begin{array}{|c|c||c|c|c||c|} \hline p & q & p\lor q & \sim q & p\lor\sim q & (p\lor q)\rightarrow(p\lor\sim q) \\ \hline T & T & T & F & T & T \\ \hline T & F & T & T & T & T \\ \hline F & T & T & F & F & F \\ \hline F & F & F & T & T & T \\ \hline \end{array}

Because the third row yields the value FF, the statement is not always true; therefore Option A is not a tautology.

Option B is   (p∧q)  →  (∼p∨q).\;(p \land q)\;\rightarrow\;(\sim p \lor q). We proceed similarly:

pqp∧q∼p∼p∨qTTTFTTFFFFFTFTTFFFTT\begin{array}{|c|c||c|c||c|} \hline p & q & p\land q & \sim p & \sim p\lor q \\ \hline T & T & T & F & T \\ \hline T & F & F & F & F \\ \hline F & T & F & T & T \\ \hline F & F & F & T & T \\ \hline \end{array}

Adding the implication column,

pqp∧q∼p∼p∨q(p∧q)→(∼p∨q)TTTFTTTFFFFTFTFTTTFFFTTT\begin{array}{|c|c||c|c|c||c|} \hline p & q & p\land q & \sim p & \sim p\lor q & (p\land q)\rightarrow(\sim p\lor q) \\ \hline T & T & T & F & T & T \\ \hline T & F & F & F & F & T \\ \hline F & T & F & T & T & T \\ \hline F & F & F & T & T & T \\ \hline \end{array}

Every row is TT, so Option B is a tautology.

Option C is   p  →  (p∨q).\;p\;\rightarrow\;(p \lor q). Observe that whenever pp is TT, the consequent p∨qp \lor q is automatically TT (since a disjunction is true if any component is true). Whenever pp is FF, the implication is vacuously true. Hence every row is TT, confirming that Option C is a tautology.

Option D is   (p∧q)  →  p.\;(p \land q)\;\rightarrow\;p. The antecedent can be TT only when both pp and qq are TT, in which case pp is certainly TT, making the implication true. In all other rows the antecedent is FF, so the implication is again vacuously true. Thus Option D is also a tautology.

Summarising, only Option A fails to remain true under every valuation. It is therefore the single statement that is not a tautology.

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