# Logical Equivalence – Domination Laws

In the previous article, you learnt about Identity law which is an equivalence. Similarly, the domination law are another equivalence that you are going to learn in this article.

Also, this equivalence need proof which is the main purpose of this document. The prove is in the form of truth table for domination laws.

## What is domination law?

The domination laws are:

\begin{aligned} &P \vee T \equiv T    \hspace{1cm} ( 1)\\ \\
&P \wedge F \equiv F  \hspace{1cm} ( 2)
\end{aligned}

First Domination Law

In the first domination law, result of is always . If is a variable that stands for “I am reading” and stands for a universal truth like “Human beings can learn“. The equivalence translates to
I am reading, or Human beings can learn

which is equivalent to saying

I am reading, which is true, but Human beings can learn“.

This is the case when truth value of is .

Consider the case when is . Then equivalence translates to
I am not reading, or Human beings can learn“.
Now because of , if any statement is , the compound preposition is . Therefore, the first equivalence is valid.

Second Domination Law

Let be the statement “I am reading” and is a universal statement “I can read 100 books in 5 minutes“. If is , the second statement becomes because it is impossible to say, “I am reading, and I can read 100 books in 5 minutes”.

Therefore, the second equivalences are valid.

Suppose is , them both gives a truth value and we have false on both sides of the equivalence. The equivalence holds.

In the first equivalence, the dominating value is and in the second equivalence the dominating value is , hence the law is called domination law.

## Truth Table of Domination Laws

To prove that equivalence is for all inputs of , we will construct the truth table for domination laws. The truth table for domination laws will have two rows because there is only one variable, which is .

Rows = 2^1 = 2