Tautologies and Contradictions
Learn about tautologies and contradictions that are fundamental concepts in mathematical reasoning.
We'll cover the following
Tautologies
A proposition that is always true is called a tautology. For example, consider the following compound proposition :
It is clear that independent of the truth value of , is always true. Therefore, is a tautology.
For any logically equivalent propositions and , the bi-implication is a tautology.
Examples
Let’s look at some examples.
Take two arbitrary propositions: and We know,
By using this equivalence, let’s make a tautology.
Using the following truth table, let’s verify that is a tautology.
(T, T) | F | F | T |
(T, F) | T | T | T |
(F, T) | T | T | T |
(F, F) | F | F | T |
It is clear by the last column that no matter what the truth value of and is is always true.
Here’s another example:
Take,
The proposition is a tautology. Let’s verify it using the following truth table:
(T, T) | T | T | T |
(T, F) | F | T | T |
(F, T) | T | F | T |
(F, F) | T | T | T |
Contradictions
A proposition that is always false is called a contradiction. For example, consider the following compound proposition :
It is clear that independent of the truth value of , is always false. Therefore, is a contradiction.
Examples
Let’s see some examples.
For some arbitrary propositions and , we make as follows:
The proposition comprises four clauses connected with conjunction operation. If and are true, then the last clause of is false. If and both are false, then the first clause of is false. In the remaining two cases, either the second or third clause is false. For to be true, all of its four clauses should be true. Let’s look at the following truth table to verify that is a contradiction
(T,T) | T | T | T | F | F |
(T,F) | T | T | F | T | F |
(F,T) | T | F | T | T | F |
(F,F) | F | T | T | T | F |
It is evident from the truth table above that no matter what the truth value of and is, is false.
For any logically equivalent propositions and , the bi-implication is a tautology. If we take the negation of any tautology, it will become a contradiction. So, is a contradiction.
Contingencies
A proposition that is neither a tautology nor a contradiction is called a contingency. That means contingency is a typical proposition that, in some instances, is true and false in others.
Examples
Let’s take a look at some examples.
Consider the following compound proposition :
It is clear that the truth value of is dependent on the truth values of , and . It can be true if is false, and it can be false if is false and is true. Therefore, is a contingency.
Following is another example of contingency,
Consider:
One more example of contingency is as follows.
Take:
Observe that is true if and are true. But is false, if is false and is true. Therefore, is a contingency.
Note that every proposition is a tautology, contradiction, or contingency. The following illustration shows this mutually exclusive classification of the propositions discussed in this lesson.
Quiz
Test your understanding of tautologies and contradictions.
Select the right category for the following statement:
It is a tautology.
It is a contingency.
It is a contradiction.
It is not a proposition.