Logical NOR

Logical NOR

NOR
Definition	${\displaystyle {\overline {x+y}}}$
Truth table	${\displaystyle (0001)}$
Logic gate
Normal forms
Disjunctive	${\displaystyle {\overline {x}}\cdot {\overline {y}}}$
Conjunctive	${\displaystyle {\overline {x}}\cdot {\overline {y}}}$
Zhegalkin polynomial	${\displaystyle 1\oplus x\oplus y\oplus xy}$
Post's lattices
0-preserving	no
1-preserving	no
Monotone	no
Affine	no
Self-dual	no
v t e

Logical connectives
NOT ${\displaystyle \neg A}$, ${\displaystyle -A}$, ${\displaystyle {\overline {A}}}$, ${\displaystyle \sim A}$ AND ${\displaystyle A\land B}$, ${\displaystyle A\cdot B}$, ${\displaystyle AB}$, ${\displaystyle A\&B}$, ${\displaystyle A\&\&B}$ NAND ${\displaystyle A{\overline {\land }}B}$, ${\displaystyle A\uparrow B}$, ${\displaystyle A\mid B}$, ${\displaystyle {\overline {A\cdot B}}}$ OR ${\displaystyle A\lor B}$, ${\displaystyle A+B}$, ${\displaystyle A\mid B}$, ${\displaystyle A\parallel B}$ NOR ${\displaystyle A{\overline {\lor }}B}$, ${\displaystyle A\downarrow B}$, ${\displaystyle {\overline {A+B}}}$ XNOR ${\displaystyle A\ {\text{XNOR}}\ B}$ └ equivalent ${\displaystyle A\equiv B}$, ${\displaystyle A\Leftrightarrow B}$, ${\displaystyle A\leftrightharpoons B}$ XOR ${\displaystyle A{\underline {\lor }}B}$, ${\displaystyle A\oplus B}$ └nonequivalent ${\displaystyle A\not \equiv B}$, ${\displaystyle A\not \Leftrightarrow B}$, ${\displaystyle A\nleftrightarrow B}$ implies ${\displaystyle A\Rightarrow B}$, ${\displaystyle A\supset B}$, ${\displaystyle A\rightarrow B}$ converse ${\displaystyle A\Leftarrow B}$, ${\displaystyle A\subset B}$, ${\displaystyle A\leftarrow B}$
Related concepts
Propositional calculus Predicate logic Boolean algebra Truth table Truth function Boolean function Functional completeness Scope (logic)
Applications
Digital logic Programming languages Mathematical logic Philosophy of logic
Category
v t e

Part of a series on
Charles Sanders Peirce
Bibliography
Pragmatism in epistemology
Abductive reasoning Fallibilism Pragmaticism as maxim as theory of truth Community of inquiry
Logic
Continuous predicate Peirce's law Entitative graph in Qualitative logic Existential graph Functional completeness Logic gate Logic of information Logical graph Logical NOR Second-order logic Trikonic Type-token distinction
Semiotic theory
Indexicality Interpretant Semiosis Sign relation Universal rhetoric
Miscellaneous contributions
Agapism Bell triangle Categories Phaneron Synechism Tychism Classification of sciences Listing number Quincuncial projection
Biographical
Joseph Morton Ransdell Allan Marquand Juliette Peirce Charles Santiago Sanders Peirce Roberta Kevelson Christine Ladd-Franklin Victoria, Lady Welby The Metaphysical Club book Peirce Geodetic Monument
v t e

In Boolean logic, logical NOR,^[1] non-disjunction, or joint denial^[1] is a truth-functional operator which produces a result that is the negation of logical or. That is, a sentence of the form (p NOR q) is true precisely when neither p nor q is true—i.e. when both p and q are false. It is logically equivalent to ${\displaystyle \neg (p\lor q)}$ and ${\displaystyle \neg p\land \neg q}$, where the symbol ${\displaystyle \neg }$ signifies logical negation, ${\displaystyle \lor }$ signifies OR, and ${\displaystyle \land }$ signifies AND.

Non-disjunction is usually denoted as ${\displaystyle \downarrow }$ or ${\displaystyle {\overline {\vee }}}$ or ${\displaystyle X}$ (prefix) or ${\displaystyle \operatorname {NOR} }$.

As with its dual, the NAND operator (also known as the Sheffer stroke—symbolized as either ${\displaystyle \uparrow }$, ${\displaystyle \mid }$ or ${\displaystyle /}$), NOR can be used by itself, without any other logical operator, to constitute a logical formal system (making NOR functionally complete).

The computer used in the spacecraft that first carried humans to the moon, the Apollo Guidance Computer, was constructed entirely using NOR gates with three inputs.^[2]