Definition: Negated conjunction: 0 NAND 0 = 1, 0 NAND 1 = 1, 1 NAND 0 = 1, 1 NAND 1 = 0.

See also and, not, or, xor.

Note: NAND is equivalent to AND followed by NOT. It is of particular interest because all possible boolean functions can be built with combinations of NANDs, and a NAND gate is easily built.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 16 July SAST 2012.
HTML page formatted Tue Feb 12 10:57:43 2019.

Cite this as:
Paul E. Black, "nand", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 July SAST 2012. (accessed TODAY) Available from: