Experiment 19 - Complete representation of Boolean algebra II
As you saw in the last experiment,
you can convert the NAND operation into a NOT, AND and OR operation.
This provides you with an alternative representation of the Boolean algebra...
The Boolean algebra is completely described with only
one operation...
while the laws continue to be valid...
-
commutative law,
-
identity
-
annihilator,
-
idempotence,
-
associative law,
|
-
distributive law,
-
absorption law,
-
double negation law and
-
de Morgan law
|
You can solve all problems of the Boolean algebra
with only one operation!
There are other complete representations
worthwhile to be mentioned...
