NAND

boolean-algebra logic

Definition

NAND

The NAND (or Sheffer stroke) is a binary logical connective. For formulas $A$ and $B$, the formula $A\uparrow B$ is true exactly when not both $A$ and $B$ are true, and false exactly when both are true.

Equivalently:

$$A\uparrow B⟺\neg (A\wedge B)$$

Truth Table

$A$	$B$	$A\uparrow B$
$0$	$0$	$1$
$0$	$1$	$1$
$1$	$0$	$1$
$1$	$1$	$0$

Circuit Notation

IEC 60617-12

US ANSI 91-1984