Logical NOR

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.

The truth table of ${\displaystyle A\downarrow B}$  is as follows:

${\displaystyle A}$	${\displaystyle B}$	${\displaystyle A\downarrow B}$
F	F	T
F	T	F
T	F	F
T	T	F

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

${\displaystyle P\downarrow Q}$	${\displaystyle \Leftrightarrow }$	${\displaystyle \neg (P\lor Q)}$
	${\displaystyle \Leftrightarrow }$	${\displaystyle \neg }$

Peirce is the first to show the functional completeness of non-disjunction while he doesn't publish his result.^[3][4] Peirce used ${\displaystyle {\overline {\curlywedge }}}$  for non-conjunction and ${\displaystyle \curlywedge }$  for non-disjunction (in fact, what Peirce himself used is ${\displaystyle \curlywedge }$  and he didn't introduce ${\displaystyle {\overline {\curlywedge }}}$  while Peirce's editors made such disambiguated use).^[4] Peirce called ${\displaystyle \curlywedge }$  the ampheck (from Ancient Greek ἀμφήκης, amphēkēs, "cutting both ways").^[4]

In 1911, Stamm [pl] was the first to publish a description of both non-conjunction (using ${\displaystyle \sim }$ , the Stamm hook), and non-disjunction (using ${\displaystyle *}$ , the Stamm star), and showed their functional completeness.^[5][6] Note that most uses in logical notation of ${\displaystyle \sim }$  use this for negation.

In 1913, Sheffer described non-disjunction and showed its functional completeness. Sheffer used ${\displaystyle \mid }$  for non-conjunction, and ${\displaystyle \wedge }$  for non-disjunction.

In 1935, Webb described non-disjunction for ${\displaystyle n}$ -valued logic, and use ${\displaystyle \mid }$  for the operator. So some people call it Webb operator,^[7] Webb operation^[8] or Webb function.^[9]

In 1940, Quine also described non-disjunction and use ${\displaystyle \downarrow }$  for the operator.^[10] So some people call the operator Peirce arrow or Quine dagger.

In 1944, Church also described non-disjunction and use ${\displaystyle {\overline {\vee }}}$  for the operator.^[11]

In 1954, Bocheński used ${\displaystyle X}$  in ${\displaystyle Xpq}$  for non-disjunction in Polish notation.^[12]

NOR is commutative but not associative, which means that ${\displaystyle P\downarrow Q\leftrightarrow Q\downarrow P}$  but ${\displaystyle (P\downarrow Q)\downarrow R\not \leftrightarrow P\downarrow (Q\downarrow R)}$ .^[13]

The logical NOR, taken by itself, is a functionally complete set of connectives.^[14] This can be proved by first showing, with a truth table, that ${\displaystyle \neg A}$  is truth-functionally equivalent to ${\displaystyle A\downarrow A}$ .^[15] Then, since ${\displaystyle A\downarrow B}$  is truth-functionally equivalent to ${\displaystyle \neg (A\lor B)}$ ,^[15] and ${\displaystyle A\lor B}$  is equivalent to ${\displaystyle \neg (\neg A\land \neg B)}$ ,^[15] the logical NOR suffices to define the set of connectives ${\displaystyle \{\land ,\lor ,\neg \}}$ ,^[15] which is shown to be truth-functionally complete by the Disjunctive Normal Form Theorem.^[15]

This may also be seen from the fact that 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.

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 ${\displaystyle \downarrow }$ , the usual operators of propositional logic are:

${\displaystyle \neg P}$      ${\displaystyle \Leftrightarrow }$      ${\displaystyle P\downarrow P}$  ${\displaystyle \neg }$        ${\displaystyle \Leftrightarrow }$		${\displaystyle P\rightarrow Q}$      ${\displaystyle \Leftrightarrow }$      ${\displaystyle {\Big (}(P\downarrow P)\downarrow Q{\Big )}}$  ${\displaystyle \downarrow }$  ${\displaystyle {\Big (}(P\downarrow P)\downarrow Q{\Big )}}$        ${\displaystyle \Leftrightarrow }$        ${\displaystyle \downarrow }$
${\displaystyle P\land Q}$      ${\displaystyle \Leftrightarrow }$      ${\displaystyle (P\downarrow P)}$  ${\displaystyle \downarrow }$  ${\displaystyle (Q\downarrow Q)}$        ${\displaystyle \Leftrightarrow }$        ${\displaystyle \downarrow }$		${\displaystyle P\lor Q}$      ${\displaystyle \Leftrightarrow }$      ${\displaystyle (P\downarrow Q)}$  ${\displaystyle \downarrow }$  ${\displaystyle (P\downarrow Q)}$        ${\displaystyle \Leftrightarrow }$        ${\displaystyle \downarrow }$

• Bitwise NOR
• Boolean algebra
• Boolean domain
• Boolean function
• Functional completeness
• NOR gate
• Propositional logic
• Sole sufficient operator
• Sheffer stroke as symbol for the logical NAND

•   Media related to Logical NOR at Wikimedia Commons