Axioms and Useful Theorems of Boolean Algebra Flashcards
(15 cards)
Cardinality
Set B contains at least two elements, a, b, such that a ≠ b
Closure
(1) a + b is in B
(2) a * b is in B
Commutativity
(1) a + b = b + a
(2) a * b = b * a
Associativity
(1) a + (b + c) = (a + b) + c
(2) a * (b * c ) = (a * b) * c
Distributivity
(1) a + (b * c) = (a + b) * (a + c)
(2) a * (b + c) = (a * b) + (a * c)
Identity
(1) a + 0 = a
(2) a * 1 = a
Complementarity
(1) a + a’ = 1
(2) a * a’ = 0
Operations with 0 and 1
(1) x + 0 = x
(2) x + 1 = 1
(3) x * 1 = x
(4) x * 0 = 0
Idempotent Theorem
(1) x + x = x
(2) x * x = x
Involution Theorem
(x’)’ = x
Simplification Theorems
(1) x * y + x * y’ = x
(2) (x + y) * (x + y’) = x
(3) x + x * y = x
(4) x * (x + y) = x
(5) (x + y’) * y = x * y
(6) (x * y’) + y = x + y
DeMorgan’s Law
(1) (x + y + z + … )’ = x’ * y’ * z’ * …
(2) (x * y * z *…)’ = x’ + y’ + z’ + …
Consensus Theorem
(1) xy + yz + x’z = xy + x’z
N-Type MOSFET
- Low: DISCONNECTED
- High: CONNECTED
P-Type MOSFET
- Low: CONNECTED (closed switch)
- High: DISCONNECTED (open switch)