Which one of the following statements is not a tautology?
First, recall the definition: a statement (propositional formula) is called a tautology if it evaluates to 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, and , there are exactly four possible ordered pairs , namely We shall evaluate each compound statement row by row.
Option A is We compute step by step.
We have
Now, the implication is false only when is and is . Introducing one extra column for the entire statement, we get
Because the third row yields the value , the statement is not always true; therefore Option A is not a tautology.
Option B is We proceed similarly:
Adding the implication column,
Every row is , so Option B is a tautology.
Option C is Observe that whenever is , the consequent is automatically (since a disjunction is true if any component is true). Whenever is , the implication is vacuously true. Hence every row is , confirming that Option C is a tautology.
Option D is The antecedent can be only when both and are , in which case is certainly , making the implication true. In all other rows the antecedent is , 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.