Which of the following Boolean expression is a tautology?
First recall some basic logical equivalences that we will use repeatedly.
is equivalent to
De Morgan’s laws: and .
We will analyse every option one by one and see whether the statement is always true (tautology) or not.
Case A:
Expression:
The term already contains every situation covered by , so using the absorption law
.
is not always true (for it is False).
Hence Option A is NOT a tautology.
Case B:
Expression:
Using , rewrite:
.
Group the disjunctions:
.
Construct a truth-table for the three literals (or test the four combinations of ):
• : expression T
• : overall F
As it becomes False, the statement is not a tautology. Hence Option B is NOT a tautology.
Case C:
Expression:
Again substitute :
.
If then the first part , so whole expression is False. Therefore it is NOT a tautology.
Case D:
Expression:
First convert the implication using :
Apply De Morgan’s law on the first term and on the second term:
Associativity and commutativity of let us group the literals:
But is always True, so
Since the expression reduces to True for every choice of and , it is a tautology.
Therefore, only Option D is a tautology.
Final Answer: Option D.
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.