Boolean algebra

:For a basic intro to sets, Boolean operations, Venn diagrams, truth tables, and Boolean applications, see Boolean logic.

Other notation

The operators of Boolean algebra may be represented in various ways. Often they

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

are simply written as AND, OR and NOT. In describing circuits, NAND (NOT AND),

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

NOR (NOT OR) and XOR (eXclusive OR) may also be used. Mathematicians, engineers, and programmers often use + for OR and · for AND (since in some ways those operations are analogous to addition and multiplication in other algebraic structures and this notation makes it very easy to get sum of products form for people who are familiar with normal algebra) and represent NOT by a line drawn above the expression being negated.

Related Topics:
Mathematician - Engineer - Programmer - Algebraic structure - Sum of products form

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

Here we use another common notation with "meet" land for AND, "join" lor for OR, and ¬ for NOT. (Readers using text-only browsers will see LaTeX codes instead of the wedge symbols they represent.)

~ ~ ~ ~ ~ ~ ~ ~ ~ ~