Logical NAND

☞ This page belongs to resource collections on Logic and Inquiry.

The logical NAND is an operation on two logical values, typically the values of two propositions, that produces a value of false if and only if both of its operands are true. In other words, it produces a value of true if and only if at least one of its operands is false.

The truth table of $p~\operatorname {NAND} ~q,$ also written $p{\stackrel {\circ }{\curlywedge }}q\!$ or $p\barwedge q,\!$ appears below:

${\text{Logical NAND}}\!$
$p\!$	$q\!$	$p{\stackrel {\circ }{\curlywedge }}q\!$
$\operatorname {F}$	$\operatorname {F}$	$\operatorname {T}$
$\operatorname {F}$	$\operatorname {T}$	$\operatorname {T}$
$\operatorname {T}$	$\operatorname {F}$	$\operatorname {T}$
$\operatorname {T}$	$\operatorname {T}$	$\operatorname {F}$

Syllabus edit

Focal nodes edit

Peer nodes edit

Logical operators edit

Relational concepts edit

Information, Inquiry edit

Document history edit

Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.