Re: Using De Morgans to reduce a boolean expression

Posted by WBahn on Jul 26, 2021; 7:08pm
URL: http://nand2tetris-questions-and-answers-forum.52.s1.nabble.com/Using-De-Morgans-to-reduce-a-boolean-expression-tp4036177p4036200.html

Here's an intuitive "proof" of (this form) of de Morgan's that might help you out.

The definition of the Or operator is that it is True if ANY of the inputs is True.

This means that the only way for it to be false is for ALL of the inputs to be False.

Therefore, for two inputs a and b:

Not(a Or b) = Not(a) And Not(b)