# 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)

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)**(

**N**ot

**AND**) A Boolean logic operation that is true if any one of its two inputs is false. A NAND gate is constructed of an AND gate followed by a NOT gate. All logic operations can be created from NAND gates. See Boolean logic and NAND flash.

Want to thank TFD for its existence? Tell a friend about us, add a link to this page, or visit the webmaster's page for free fun content.

Link to this page: