Let be such that the logical statement is a tautology. Then is equal to
First, we need to find such that is a tautology.
Next, recall that an implication is a tautology when is true whenever is true. Therefore, we need: whenever is true, must also be true.
Now, test . The statement becomes:
Substituting, this simplifies to:
Since the implication must hold in all cases, consider the following:
Case 1: is True (so is False). The implication is True.
Case 2: is False (so is True). The RHS becomes . So is True.
Since the implication is true in all cases, it is a tautology. ✓
Next, verify that the other options fail.
For : Let . Then LHS: , RHS: . So is False. ✗
For : Let . Then LHS: , RHS: . So is False. ✗
For : Let . Then LHS: , so implication is True. Let . Then LHS: , RHS: . So is False. ✗
Therefore, the answer is Option C: .
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.