Boolean algebra is a significant tool for the analysis and design of electronic computers. It has wide applications to switching theory and logical design of electronic circuits.
7.1 DEFINITIONS AND BASIC PROPERTIES
A non-empty set B with two binary operations ∨ and ∧, a unary operation ′, and two distinct elements 0 and I is called a Boolean Algebra if the following axioms holds for any elements a, b, c ∈ B:
[B1]: Commutative Laws
[B2]: Distributive Laws
[B3]: Identity Laws:
[B4]: Complement Laws:
We shall call 0 as zero element, ...