Axiomatic Definition of Boolean Algebra
Axiomatic Definition of Boolean Algebra
lattice that consists of a set B along with two binary operations (AND, OR) and a unary
1. Closure
For all a, b in B:
- a OR b is in B (join operation)
2. Commutativity
- a AND b = b AND a
- a OR b = b OR a
3. Associativity
- (a OR b) OR c = a OR (b OR c)
4. Distributivity
- a OR (b AND c) = (a OR b) AND (a OR c)
5. Identity
- a OR 0 = a
6. Complement
- a AND a' = 0
- a OR a' = 1
7. Absorption
- a AND (a OR b) = a
- a OR (a AND b) = a
Derived Properties:
- De Morgan's Laws:
1. Logic: The set {True, False}, with operations AND, OR, and NOT.
- Intersection as AND,
- Union as OR,
- Complement as NOT.
3. Digital Logic: The two states 0 and 1, with binary operations corresponding to logic gates.