MTH 215

Computing Foundations

Name Laws of Logic

Commutative laws a) p ∧ q ≡ q ∧ p b) p∨q ≡q∨p
Associative laws a) (p ∧ q) ∧ r ≡ p ∧ (q ∧ r) b) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r)
Distributive laws a) p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) b) p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Identity laws a) p ∧ T ≡ p b) p∨F ≡p
Inverse laws a) p ∧ ¬p ≡ F b) p ∨ ¬p ≡ T
Double negation law ¬¬p ≡ p
Idempotent laws a) p ∧ p ≡ p b) p∨p≡p
DeMorgan’s laws a) ¬(p ∧ q) ≡ ¬p ∨ ¬q b) ¬(p ∨ q) ≡ ¬p ∧ ¬q
Annihilation laws a) p ∧ F ≡ F b) p∨T ≡T
Absorption laws a) p ∧ (p ∨ q) ≡ p b) p ∨ (p ∧ q) ≡ p
Negation laws a) ¬T = F b) ¬F = T

Name Laws of Set Theory

Commutative laws a) A ∩ B = B ∩ A b) A∪B =B∪A
Associative laws a) (A ∩ B) ∩ C = A ∩ (B ∩ C) b) (A ∪ B) ∪ C = A ∪ (B ∪ C)
Distributive laws a) A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) b) A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
Identity laws a) A ∩ U = A b) A∪∅=A
Inverse laws a) A ∩ Ac = ∅ b) A ∪ Ac = U
Double complement law (Ac )c = A
Idempotent laws a) A ∩ A = A b) A∪A=A
DeMorgan’s laws a) (A ∩ B)c = Ac ∪ B c b) (A ∪ B)c = Ac ∩ B c
Annihilation laws a) A ∩ ∅ = ∅ b) A∪U =U
Absorption laws a) A ∩ (A ∪ B) = A b) A ∪ (A ∩ B) = A
Complement laws a) U c = ∅ b) ∅c = U

Name Axioms of Boolean Algebra

Commutative axiom a) x × y = y × x b) x+y =y+x
Associative axiom a) x × (y × z) = (x × y) × z b) x + (y + z) = (x + y) + z
Distributive axiom a) x × (y + z) = (x × y) + (x × z) b) x + (y × z) = (x + y) × (x + z)
Identity axiom a) x × 1 = x b) x+0=x
Inverse axiom a) x × x0 = 0 b) x + x0 = 1
Name Laws of Boolean Algebra
Double negation law x00 = x
Idempotent laws a) x × x = x b) x+x=x
DeMorgan’s laws a) (x × y)0 = x0 + y 0 b) (x + y)0 = x0 × y 0
Annihilation laws a) x × 0 = 0 b) x+1=1
Absorption laws a) x × (x + y) = x b) x + (x × y) = x
Complement laws a) 10 = 0 b) 00 = 1