2nd Edition: A1.3 The Expressive Power of Nand

[ouverson]

In A1.3 The Expressive Power of Nand

There is a phrase:

"It follows that any Boolean function can be represented by a Boolean expression containing only And, Or, and And operators."



I think this was supposed to be "... only And, Or, and Not operators."

[Mornaug]

I just caught that myself and it made me question my reality for a split second. Glad someone else caught that!