Professional Documents
Culture Documents
2/23/01
Assume that a Boolean Algebra B has elements that take one of two values 0 or 1.
Axioms - Rules of Boolean Algebra. 1a 1b 2a 2b 3a 3b 4a 4b 00=0 1+1=1 11=1 0+0=0 01=10=0 1+0=0+1=1 If x=0, then x'=1 If x=1, then x'=0
Single variable theorems from axioms: 5a 5b 6a 6b 7a 7b 8a 8b 9 x0=0 x+1=1 x1=x x+0=x xx=x x+x=x x x' = 0 x + x' = 1 x'' = x Prove by induction substituting x=0 and x=1 and use the axioms.
Duality Given a logic expression, its dual is obtained by replacing all + operations with operations and vice versa, and by replacing all 0s with 1s and vice versa. The dual of any true statement is also a true statement. Pairs of single variable theorems are duals. Two and three variable properties: 10a 10b 11a 11b 12a 12b 13a 13b 14a 14b 15a 15b 16a 16b xy=yx x+y=y+x x (y z) = (x y) z x + (y + z) = (x + y) + z x (y + z) = x y + x z x + y z = (x + y) (x + z) x+xy=x x (x + y) = x x y + x y' = x (x + y) (x + y') = x (x y)' = x' + y' (x + y)' = x' y' x + x' y = x + y x (x' + y) = x + y DeMorgans Theorem Commutative (10a's dual) Associative
Distributive
Absorption
Problem 2.1
Prove x + yz = (x + y)(x + z)
x = (x + y) (x + y') = xx + xy + xy' + yy' = x + xy + xy' + yy' = x + xy + xy' + 0 = x (1 + y + y') = x (1) =x Truth tables or algebraic manipulation can be used to prove two expressions are equivalent. Algebraic manipulation can also be used to reduce an expression (or circuit).
x y f
f x
F = yz + xyz' + xyz + xy'z' + xy'z = yz + x(yz' + yz + y'z' + y'z) = yz + x(y(z + z') + y'(z' + z)) = yz + x(y(1) + y'(1)) = yz + x(y + y') = yz + x(1) = yz + x
y z x
F(x,y,z) = (1, 2, 3, 6) = x'y'z + x'yz' + x'yz + xyz' = x'y'z + x'yz + yz'(x'+x) = x'y'z + x'yz + yz' = x'z(y'+y) + yz' = x'z(1) + yz' = x'z + yz'
Venn Diagrams:
x + y
(x + y)'
x z
x z
y + x