We examine the relationship between the abstract structure of a Boolean algebra and the practical problem of creating logic networks for solving problems. There is a fundamental equivalence between Truth Functions, Boolean Expressions, and Logic Networks which allows us to pass from one to the other.
Example: Two light switches, one light!
The problem is as follows: A light at the bottom of some stairs is controlled by two light switches, one at each end of the stairs. The two switches should be able to control the light independently. How do we wire the light?
Example: Practice 11, p. 485/558
Example: Exercise 10/11, p. 495/568
Example: Exercise 1b, p. 493/566
Example: Exercise 2, p. 493/567
We can use properties of Boolean algebra to simplify the canonical form, creating a much simpler logic network as a result.
Example: Practice 11, p. 485/558
Half-Adders and Full-Adders
Half-Adder: Adds two binary digits.
Note, however, that the half-adder doesn't implement s in this way: instead,
Questions:
Full-Adder: Adds two digits plus the carry digit (made up of two half-adders, essentially!).
, 
, 
to the sum digit s
of a half-adder of , , to get 
.
, compare carry digits of both half-adders, to see
if either gives a 1 (in which case 
).
Example: Practice 12, p. 490/563
