Category:Logical NAND
Jump to navigation
Jump to search
This category contains results about Logical NAND in the context of Propositional Logic.
Definitions specific to this category can be found in Definitions/Logical NAND.
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$
Also see
Subcategories
This category has the following 5 subcategories, out of 5 total.
C
- Conditional in terms of NAND (3 P)
N
- NAND is Commutative (3 P)
- NAND is not Associative (3 P)
- NAND with Equal Arguments (3 P)
Pages in category "Logical NAND"
The following 12 pages are in this category, out of 12 total.