NAND

(redirected from NAND gates)
Also found in: Dictionary.
Related to NAND gates: Logic gates

NAND

[nand]
(mathematics)
A logic operator having the characteristic that if P, Q, R, … are statements, then the NAND of P, Q, R, … is true if at least one statement is false, false if all statements are true. Derived from NOT-AND. Also known as sheffer stroke.

NAND

Not AND.

The Boolean function which is true unless both its arguments are true, the logical complement of AND:

A NAND B = NOT (A AND B) = (NOT A) OR (NOT B)

Its truth table is:

A | B | A NAND B --+---+--------- F | F | T F | T | T T | F | T T | T | F

NAND, like NOR, forms a complete set of Boolean functions on its own since it can be used to make NOT, AND, OR and any other Boolean function:

NOT A = A NAND A

A AND B = NOT (A NAND B)

A OR B = (NOT A) NAND (NOT B)

NAND

(1) See NAND flash.

(2) (Not AND) A Boolean logic operation that is true if any single input is false. Two-input NAND gates are often used as the sole logic element on gate array chips, because all Boolean operations can be created from NAND gates. See flash memory.


References in periodicals archive ?
We used these optical switches to construct a NAND gate, which is a fundamental building block of modern computer processing.
Applying function Gates to this circuit should return 5 AND gates and 3 NAND gates while function Levels should return { {AND, AND, NAND, NAND, NAND}, {AND, AND, AND} }.
An AND gate inverts the signal propagated by a NAND gate while an OR gate inverts that propagated by a NOR gate.