Boolean algebra is a type of algebra first developed by George Boole. It differs from regular algebra in that it uses only two values, usually denoted 0 and 1. It has many different applications in logic, computer hardware and software development, and set theory.

There are three basic operators:

*Conjunction*, similar to multiplication in ordinary algebra. The conjunction of`x`and`y`is denoted`x`·`y`or`xy`.*Disjunction*, similar to addition in ordinary algebra. The disjunction of`x`and`y`is denoted`x`+`y`.*Negation*, which is denoted !`x`. !0 = 1 and !1 = 0.

Since there are only two values, the "addition" and "multiplication" tables are much simpler than they are for ordinary calculations:

· | 0 | 1 |
---|---|---|

0 | 0 | 0 |

0 | 0 | 1 |

+ | 0 | 1 |
---|---|---|

0 | 0 | 1 |

0 | 1 | 1 |