CALCULATION OF CIRCUITS BY
THE ALGEBRA OF LOGIC
In 1937 a research assistant at Massachusetts Institute of Technology, Claude E. Shannon, was studying for his degree of master of science. He was enrolled in the Department of Electrical Engineering. He was interested in automatic switching circuits and wondered why an algebra should not apply to them. He wrote his thesis on the answer to this question and showed that:
- (1) There is an algebra that applies to switching circuits.
- (2) It is the algebra of logic.
A paper, based on his thesis, was published in 1938 in the Transactions of the American Institute of Electrical Engineers with the title “A Symbolic Analysis of Relay and Switching Circuits.”
Fig. 1. Switches in series.
For a simple example of what Shannon found out, suppose that we have two switches, 1, 2, in series ([see Fig. 1]). When do we get current flowing from the source to the sink? There are 4 possible cases and results ([see Table 9]).
Table 9
| Switch 1 is closed | Switch 2 is closed | Current flows |
|---|---|---|
| Yes | Yes | Yes |
| No | Yes | No |
| Yes | No | No |
| No | No | No |
Now what does this table remind us of? It is precisely the truth table for “and.” It is just what we would have if we wrote down the truth table of the statement “Switch 1 is closed and switch 2 is closed.”