Which of the following is a tautology?
We recall that a statement is called a tautology when it remains true for every possible truth-value assignment of its component propositions. We shall examine each option one by one, reducing the compound statement with standard logical identities and looking for a possible counter-example. If even a single assignment makes the statement false, then it is not a tautology.
We begin with Option A:
First we simplify the antecedent "". Using the distributive law
with we obtain
Now is a contradiction, i.e. it is always false, so it may be dropped from the disjunction:
Therefore Option A becomes
Next we recall the definition of implication:
Replacing with and with gives
Apply De Morgan’s law to the negation inside:
So the whole expression is
The associative and commutative laws for disjunction permit us to regroup and obtain
Within the parentheses, is the law of excluded middle, which is always true, i.e. a tautology . Hence we have
Thus Option A simplifies to a statement that is invariably true, making it a tautology.
Now we test Option B:
First expand each implication using :
Hence
by De Morgan’s law. Therefore Option B becomes
We look for a truth-value combination that makes the whole disjunction false. A disjunction is false only when each of its components is false. So we need
Take and . Then
Also Both parts are false, so the entire statement is false for this assignment. Hence Option B is not a tautology.
Next we inspect Option C:
Choose (i.e. is false). Then , so the antecedent is true irrespective of . The consequent , however, is false. Therefore the implication becomes which is false. So Option C is also not a tautology.
Finally Option D:
This is logically equivalent to the biconditional which is true only when and share the same truth value. Take . Then , so the whole conjunction is false. Consequently Option D is not a tautology.
Only Option A survives every test and is always true.
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.