Logical NOR

Logical NOR
NOR
Definition
Truth table
Logic gate
Normal forms
Disjunctive
Conjunctive
Zhegalkin polynomial
Post's lattices
0-preserving	no
1-preserving	no
Monotone	no
Affine	no
Self-dual	no

In boolean logic, logical nor or joint denial 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 of p and q are false. In grammar, nor is a coordinating conjunction.

The NOR operator is also known as Peirce's arrow—Charles Sanders Peirce introduced the symbol ↓ for it,^[1] and demonstrated that the logical NOR is completely expressible: by combining uses of the logical NOR it is possible to express any logical operation on two variables. Thus, as with its dual, the NAND operator (a.k.a. the Sheffer stroke—symbolized as either ↑, | or /), NOR can be used by itself, without any other logical operator, to constitute a logical formal system (making NOR functionally complete). It is also known as Quine's dagger (his symbol was †), the ampheck (from Ancient Greek ἀμφήκης, amphēkēs, "cutting both ways") by Peirce,^[2] or neither-nor.

Other ways of notating $P\downarrow Q$ include, P NOR Q, and "Xpq" (in Bocheński notation). It is logically equivalent to $\neg (P\lor Q)$ , where the symbol $\lor$ signifies OR and $\neg$ signifies the negation.

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.^[3]

Definition

The NOR operation is a logical operation on two logical values, typically the values of two propositions, that produces a value of true if and only if both operands are false. In other words, it produces a value of false if and only if at least one operand is true.

Truth table

The truth table of $P\downarrow Q$ (also written as P NOR Q) is as follows:

$P$	$Q$	$P\downarrow Q$
T	T	F
T	F	F
F	T	F
F	F	T

Logical Equivalences

The logical NOR $\downarrow$ is the negation of the disjunction:

$P\downarrow Q$	$\Leftrightarrow$	$\neg (P\lor Q)$
	$\Leftrightarrow$	$\neg$

Properties

Logical NOR does not possess any of the five qualities (truth-preserving, false-preserving, linear, monotonic, self-dual) required to be absent from at least one member of a set of functionally complete operators. Thus, the set containing only NOR suffices as a complete set.

Other Boolean Operations in terms of the Logical NOR

NOR has the interesting feature that all other logical operators can be expressed by interlaced NOR operations. The logical NAND operator also has this ability.

Expressed in terms of NOR $\downarrow$ , the usual operators of propositional logic are:

$\neg P$	$\Leftrightarrow$	$P\downarrow P$
$\neg$	$\Leftrightarrow$

$P\rightarrow Q$	$\Leftrightarrow$	${\Big (}(P\downarrow P)\downarrow Q{\Big )}$	$\downarrow$	${\Big (}(P\downarrow P)\downarrow Q{\Big )}$
	$\Leftrightarrow$		$\downarrow$

$P\land Q$	$\Leftrightarrow$	$(P\downarrow P)$	$\downarrow$	$(Q\downarrow Q)$
	$\Leftrightarrow$		$\downarrow$

$P\lor Q$	$\Leftrightarrow$	$(P\downarrow Q)$	$\downarrow$	$(P\downarrow Q)$
	$\Leftrightarrow$		$\downarrow$

References

↑ Hans Kleine Büning; Theodor Lettmann (1999). Propositional logic: deduction and algorithms. Cambridge University Press. p. 2. ISBN 978-0-521-63017-7.
↑ C.S. Peirce, CP 4.264
↑ Hall, Eldon C. (1996), Journey to the Moon: The History of the Apollo Guidance Computer, Reston, Virginia, USA: AIAA, p. 196, ISBN 1-56347-185-X

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[BüningLettmann1999-1] Hans Kleine Büning; Theodor Lettmann (1999). Propositional logic: deduction and algorithms. Cambridge University Press. p. 2. ISBN 978-0-521-63017-7.

[2] C.S. Peirce, CP 4.264

[Hall-1996-3] Hall, Eldon C. (1996), Journey to the Moon: The History of the Apollo Guidance Computer, Reston, Virginia, USA: AIAA, p. 196, ISBN 1-56347-185-X

Logical connectives
Tautology/True $\top$
Alternative denial (NAND gate) $\uparrow$ Converse implication $\leftarrow$ Implication (IMPLY gate) $\rightarrow$ Disjunction (OR gate) $\lor$
Negation (NOT gate) $\neg$ Exclusive or (XOR gate) $\oplus$ Biconditional (XNOR gate) $\leftrightarrow$ Statement
Joint denial (NOR gate) $\downarrow$ Nonimplication $\nrightarrow$ Converse nonimplication $\nleftarrow$ Conjunction (AND gate) $\land$
Contradiction/False $\bot$

NOR

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