Some Equivalence Propositional Laws in Boolean Algebra

In Boolean Algebra and Propositional Logic, two logical expressions are said to be equivalent if they produce the same truth value under every possible condition.

These equivalence laws are extremely important because they help simplify logical expressions, solve Boolean Algebra problems, simplify logic circuits, and prove logical statements.

Table of Equivalence Laws

Sl. No.	Law	Boolean Expression	Description
1	Properties of 0	\(0 + p = p\) \(0 \cdot p = 0\)	Adding 0 does not change the value, while multiplying by 0 always gives 0.
2	Properties of 1	\(1 + p = 1\) \(1 \cdot p = p\)	OR with 1 always gives 1, while multiplying by 1 keeps the original value unchanged.
3	Absorption Law	\(p + pq = p\) \(p \cdot (p + q) = p\)	The variable absorbs the extra term and simplifies the expression.
4	Involution Law	\(\overline{\overline{p}} = p\)	Double complement returns the original variable.
5	Idempotence Law	\(p + p = p\) \(p \cdot p = p\)	Repeating the same variable does not change its value.
6	Complementarity Law	\(p + \overline{p} = 1\) \(p \cdot \overline{p} = 0\)	A variable OR its complement gives 1, while AND with its complement gives 0.
7	Commutative Law	\(p + q = q + p\) \(p \cdot q = q \cdot p\)	The order of variables does not affect the result.
8	Associative Law	\((p + q) + r = p + (q + r)\) \((p \cdot q) \cdot r = p \cdot (q \cdot r)\)	Grouping of variables does not affect the result.
9	Distributive Law	\(p \cdot (q + r) = (p \cdot q) + (p \cdot r)\) \(p + (q \cdot r) = (p + q) \cdot (p + r)\) \(p + \overline{p}q = p + q\)	Similar to algebraic distribution, multiplication distributes over addition and vice versa.
10	De Morgan’s Law	\(\overline{p + q} = \overline{p} \cdot \overline{q}\) \(\overline{p \cdot q} = \overline{p} + \overline{q}\)	The complement of OR becomes AND of complements, and complement of AND becomes OR of complements.
11	Conditional Elimination	\(p \Rightarrow q = \overline{p} + q\)	A conditional statement can be rewritten using OR operation.
12	Bi-conditional Elimination	\(p \Leftrightarrow q = (p \Rightarrow q) \cdot (q \Rightarrow p)\)	A bi-conditional statement is equivalent to two conditional statements together.

Important Notes

These laws are used to simplify Boolean expressions and logical statements.
They are very important in Digital Electronics, Logic Circuits, Computer Science, and Programming.
De Morgan’s Law and Distributive Law are frequently used in logic gate simplification.
Conditional Elimination and Bi-conditional Elimination are important in Propositional Logic.

Applications of Boolean Laws

Boolean laws are used in:

Digital circuit design
Logic gate simplification
Computer architecture
Programming conditions
Artificial Intelligence
Database searching
Mathematical logic

Key Points to Remember

\(+\) represents OR operation.
\(\cdot\) represents AND operation.
\(\overline{p}\) represents complement (NOT operation).
Boolean Algebra works only with 0 and 1.
These laws help simplify complex logical expressions.

Conclusion

Equivalence propositional laws are the foundation of Boolean Algebra and Propositional Logic. Understanding these laws helps students simplify logical expressions quickly and solve problems accurately.

Mastering these laws is essential for learning Digital Electronics, Logic Gates, Computer Organization, and Programming Logic.