Boolean Algebra is useful for describing logic circuits
Boolean
Postulate = Axioms
- Postulate 1: Closure with respect to (wrt) ’+’ and ’
’ ,
- Postulate 2: An identity element wrt ’+’, denoted by 0, and an identity element wrt ’
’ denoted by 1 ,
- Postulate 3: Commutative wrt ’+’ and ’
’ ,
- Postulate 4: Distributive over ’+’ and ’
’ - Postulate 5: For each element
there exists an element such that and
- Postulate 6: There exists at least 2 elements
such that
