# Category:Logical NOR

Jump to navigation
Jump to search

This category contains results about Logical NOR in the context of Propositional Logic.

Definitions specific to this category can be found in Definitions/Logical NOR.

**NOR** (that is, **not or**), is a binary connective, written symbolically as $p \downarrow q$, whose behaviour is as follows:

- $p \downarrow q$

is defined as:

**neither $p$ nor $q$ is true.**

$p \downarrow q$ is voiced:

**$p$ nor $q$**

## Pages in category "Logical NOR"

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

### N

- NAND and NOR are Functionally Complete
- NOR is Commutative
- NOR is Commutative/Proof 1
- NOR is Commutative/Proof 2
- NOR is Functionally Complete
- NOR is not Associative
- NOR is not Associative/Proof 1
- NOR is not Associative/Proof 2
- NOR with Equal Arguments
- NOR with Equal Arguments/Proof 1
- NOR with Equal Arguments/Proof 2