NOT gate[change | change source]
The NOT operator is written with a bar over numbers or letters like this:
It means the output is not the input.
AND gate[change | change source]
The AND operator is written as like this:
The output is true only if one and the other input is true.
OR gate[change | change source]
The OR operator is written as like this:
One or the other input can be true for the output to be true.
XOR gate[change | change source]
One or the other input can be true to make the output true, but NOT both.
The XOR operator is written as like this:
Identities[change | change source]
Different gates can be put together in different orders:
- is the same as an AND then a NOT. This is called a NAND gate.
It is not the same as a NOT then an AND like this:
which is called XOR identity table
, if .[source?]
Augustus De Morgan found out that it is possible to change a sign to a sign and make or break a bar. See the 2 examples below:
"Make/break the bar and change the sign."
Other pages[change | change source]
References[change | change source]
- "Boolean algebra | Define Boolean algebra at Dictionary.com". Dictionary.reference.com. 1997-02-27. http://dictionary.reference.com/browse/Boolean+algebra. Retrieved 2010-08-12.
- "Logic Gates". Kpsec.freeuk.com. http://www.kpsec.freeuk.com/gates.htm. Retrieved 2010-08-12.