If a composite proposition p is always true for all possible assignment of truth values to its prime components, then it is called tautology.
The following are some examples of tautology:
If a condition is a tautology, then we say that p implies q i.e
.
Truth table