# Category:Logical NAND

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

## Subcategories

This category has the following 4 subcategories, out of 4 total.

### I

### N

## Pages in category "Logical NAND"

The following 14 pages are in this category, out of 14 total.