NAND

boolean-algebra logic

NAND

NAND, often denoted as $\uparrow$, is a binary operator in propositional logic. It can be expressed as the negation of the conjunction of two variables:

$$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