Which one of the following Boolean expression is a tautology?
First, remember that a Boolean expression is called a tautology if it is always true, no matter whether the simple propositions and are true (T) or false (F). To decide which option is a tautology, we shall simplify every given expression algebraically, employing these standard Boolean laws:
Now we analyse each option one by one.
Option A:
We notice that is the negation of by De Morgan’s law, so we may write
This is exactly the exclusive-or (“one but not both”) condition. For example, if both and are true, then is true, its negation is false, and the whole expression becomes false. Hence Option A is not always true, so it is not a tautology.
Option B:
We factor out the common literal using the distributive law (1):
By the complement law (3), , so
Since can be true or false, the whole expression can also be true or false; therefore it is not a tautology.
Option C:
Here we use the distributive law (2) in reverse, pulling out the common literal :
Again by the complement law (3), , so we get
This reduces to the single variable , which is not always true, so Option C is also not a tautology.
Option D:
Using associativity and commutativity of , we simply collect all the literals:
Now group the complementary pairs:
So the entire expression becomes
which is true for every possible truth‐value combination of and . Therefore Option D is a tautology.
After examining all four choices, we see that only Option 4 (that is, Option D) is always true.
Hence, the correct answer is Option 4.
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.