Boolean algebra

LawEquation
AnnulmentA ^ 0 = 0, A v 1 = 1
IdentityA ^ 1 = A, A v 0 = A
IdempotentA v A = A, A ^ A = A
ComplementA v A’ = 1, A ^ A’ = 0
Double Negation(A’)’ = A
De Morgan’s(A ^ B)’ = A’ v B’, (A v B)’ = A’ ^ B’
Associative(A v B) v C = A v (B v C), (A ^ B) ^ C = A ^ (B ^ C)
CommutativeA v B = B v A, A ^ B = B ^ A
DistributiveA ^ (B v C) = (A ^ B) v (A ^ C)
AbsorptiveA v (A^B) = A, A ^ (A v B) = A
ConsensusAB v A’C v BC = AB v A’C
Consensus(A+B).(A’+C).(B+C) = (A+B).(A’+C)

simplification of boolean algebra

Boolean functions

Obeys duality