deMorgan's Law

For today's assignment, you will discover an important logic fact. Consider the following statement: 
  ¬(a or b)
It can be simplified, but to what? The main candidates would be: 
  ¬a or ¬b
or 
  ¬a and ¬b
likewise: 
  ¬(a and b)
is either 
  ¬a or ¬b
or 
  ¬a and ¬b
Figure out the relationships between these statements. On a piece of paper, tell us how to simplify ¬(a or b) and ¬(a and b). Prove your answers with truth tables and circuit diagrams. You may use digSim to generate the diagrams, but you will need to sketch out the resulting circuits on paper, as the save and load features are disabled for security reasons.

You should have at least two truth tables and two circuit diagrams, although you may have more if you choose to prove which answers are NOT true.
© Andy Harris
Indiana University / Purdue University, Indianapolis
email: aharris@.cs.iupui.edu
homepage: http://www.cs.iupui.edu/~aharris