Jump to content

Complete set of Boolean operators

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 196.36.80.163 (talk) at 11:12, 10 October 2005 (Fixed error). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A complete boolean algebra is a collection of boolean operators which permits the realisation of any possible truth table.

Example truth table (Xor):

a b Result
0 0 0
0 1 1
1 0 1
1 1 0

Using a complete boolean algebra which does not include XOR (such as the well-known AND OR NOT set), this function can be realised as follows:

(a or b) and not (a and b).

However, other complete boolean algebras are possible, such as NAND or NOR (either gate can form a complete boolean algebra by itself - the proof is detailed on their pages).

Note that just because a set of gates forms a complete boolean algebra does not mean that the resulting expressions will be simple. To gain an XOR function using only NAND gates, for example, is a fairly complex expression - the important thing is that it exists.