NAND (that is, not and), is a binary connective, written symbolically as $p \uparrow q$, whose behaviour is as follows:
- $p \uparrow q$
is defined as:
- it is not the case that $p$ and $q$ are both true.
$p \uparrow q$ is voiced:
- $p$ nand $q$
This category has the following 5 subcategories, out of 5 total.
Pages in category "Logical NAND"
The following 12 pages are in this category, out of 12 total.