Boolean algebra
Boolean algebra is algebra for binary (0 meaning false, or 1 meaning true). It uses normal maths symbols, but it does not work in the same way. It is named after its creator George Boole.[1]
Contents |
[change] NOT gate
| NOT | |
|---|---|
| 0 | 1 |
| 1 | 0 |
The NOT operator is written with a bar over numbers or letters like this:
It means the output is not the input.
[change] AND gate
| AND | 0 | 1 |
|---|---|---|
| 0 | 0 | 0 |
| 1 | 0 | 1 |
The AND operator is written as
like this:
The output is true only if one and the other input is true.
[change] OR gate
| OR | 0 | 1 |
|---|---|---|
| 0 | 0 | 1 |
| 1 | 1 | 1 |
The OR operator is written as
like this:
One or the other input can be true for the output to be true.
[change] XOR gate
| XOR | 0 | 1 |
|---|---|---|
| 0 | 0 | 1 |
| 1 | 1 | 0 |
One or the other input can be true to make the output true, but NOT both.
The XOR operator is written as
like this:
[change] Identities
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
| XOR | 1 | 0 | Any |
|---|---|---|---|
| 1 | TRUE | 0 | 0 |
| 0 | 0 | 0 | ![]() |
| Any | 0 | ![]() |
![]() |
, if
.[source?]
or if 
=TRUE, TRUE.,
[change] DeMorgan's laws
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."
[change] Other pages
[change] References
- ↑ "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.
- ↑ 2.0 2.1 2.2 2.3 "Logic Gates". Kpsec.freeuk.com. http://www.kpsec.freeuk.com/gates.htm. Retrieved 2010-08-12.
|
||||||||















is the same as an AND then a NOT. This is called a NAND gate.






