Other Logical Equivalences and Laws
What You'll Learn
You'll master the fundamental algebraic laws that govern how logical operators combine and simplify—just like arithmetic rules, but for logic.
The Core Idea
Beyond De Morgan's Laws, logic has a rich algebra with laws that mirror familiar arithmetic properties. These equivalences let you manipulate logical expressions systematically, making complex propositions easier to work with.
Commutativity
Order doesn't matter for AND and OR:
p ∧ q ≡ q ∧ pp ∨ q ≡ q ∨ p
Just like 3 + 5 = 5 + 3 in arithmetic.
Associativity
Grouping doesn't matter when chaining the same operator:
(p ∧ q) ∧ r ≡ p ∧ (q ∧ r)(p ∨ q) ∨ r ≡ p ∨ (q ∨ r)
Distributivity
AND distributes over OR, and OR distributes over AND:
p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
The first is like arithmetic; the second is unique to logic!
Identity Laws
TRUE (T) and FALSE (F) act as neutral elements:
p ∧ T ≡ p(TRUE doesn't restrict)p ∨ F ≡ p(FALSE adds nothing)
Domination Laws
p ∧ F ≡ F(AND with FALSE kills everything)p ∨ T ≡ T(OR with TRUE makes everything true)
Absorption Laws
One operator can "absorb" the other:
p ∨ (p ∧ q) ≡ pp ∧ (p ∨ q) ≡ p
If p is already true, p ∧ q doesn't add information to p.
Idempotent Laws
Repeating doesn't change the result:
p ∧ p ≡ pp ∨ p ≡ p
Why This Matters
These laws form a Boolean algebra—a complete system for manipulating logical expressions. They're essential for simplifying proofs, circuit design, and database queries.
Key Takeaway: Logical operators follow algebraic laws (commutativity, associativity, distributivity, identity, domination, absorption, idempotence) that let you systematically transform and simplify propositions.