<?xml version="1.0" encoding="ISO-8859-1" ?>
<?xml-stylesheet type="text/css" href="http://www.getwiki.net/styles/plug.css" ?>
<getwiki version="2.0" xml:lang="en">
  <page>
    <title>Logical_NNOR</title>
    <revision>
      <timestamp>2007-04-07T18:54:55Z</timestamp>
      <contributor>
        <username>Jon Awbrey</username>
      </contributor>
      <comment>make cols</comment>
      <text>&lt;!--  via Wikinfo: 
      last updated: 20061024163822
      updated by: Jon Awbrey
      update comment: cleanup
//--&gt;
&lt;!--  via Wikipedia: Logical NOR
      version: 20:38, 11 September 2006
      updater: Santiago Saint James
      comment: /* Logical operators */ arreglar 
//--&gt;

{{disclaim}}&lt;br&gt;

{{dablink|This article is about NOR in the logical sense. For the electronic NOR gates see [[NOR gate]], for other uses of similar terms, see [[NOR (disambiguation)]].}}

[[Image:NOR.jpg|thumb|right|150px|NOR Logic Gate]]

The '''logical NNOR''', for '''Neither Nor''', also called '''NOR''', for '''Not Or''', or '''joint denial''', is a [[boolean logic]] operator that produces a result that is the inverse of [[logical disjunction|logical or]]. That is, (''not or''), ''p'' NNOR ''q'' is only true when both ''p'' and ''q'' are ''false''.  

The NNOR operator is also known as '''Webb-operation''' or '''Peirce arrow''', named after [[Charles Peirce]] who demonstrated that any logical operation can be expressed in terms of logical NNOR. Thus, as with [[logical NAND|NAND operator]], NNOR can be used by itself, without any other logical operator, to constitute a logical formal system (making NNOR [[functional completeness|functionally complete]]).

==Definition==

The '''NNOR operation''' is a [[logical operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, 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 '''p NNOR q''' (also written as '''p &amp;#8869; q''' or '''p &amp;#8595; q''') is as follows:

{| align=&quot;center&quot; border=&quot;1&quot; cellpadding=&quot;8&quot; cellspacing=&quot;0&quot; style=&quot;background:lightcyan; font-weight:bold; text-align:center; width:45%&quot;
|+ '''Logical NNOR'''
|- style=&quot;background:paleturquoise&quot;
! style=&quot;width:15%&quot; | p
! style=&quot;width:15%&quot; | q
! style=&quot;width:15%&quot; | p &amp;#8595; q
|-
| F || F || T
|-
| F || T || F
|-
| T || F || F
|-
| T || T || F
|}
&lt;br&gt;

One way of expressing ''p'' NNOR ''q'' is &lt;math&gt;\overline{p \lor q}&lt;/math&gt;, where the symbol &lt;math&gt;\or&lt;/math&gt; signifies OR and the bar over the expression signifies the negation of the expression under the bar.

==Joint Denial==

NNOR has the interesting feature that all other [[logical operator]]s can be expressed by various functions of NNOR.

{|
|-
|&quot;not ''p''&quot; is equivalent to &quot;''p'' NNOR ''p''&quot;
|&lt;math&gt;\overline{p} \equiv \overline{p + p}&lt;/math&gt;
|-
|&quot;''p'' and ''q''&quot; is equivalent to &quot;(''p'' NNOR ''p'') MNOR (''q'' NNOR ''q'')&quot;
|&lt;math&gt;p \cdot q \equiv \overline{\overline{(p + p)} + \overline{(q + q)}}&lt;/math&gt;
|-
|&quot;''p'' or ''q''&quot; is equivalent to &quot;(''p'' NNOR ''q'') NNOR (''p'' NNOR ''q'')&quot;
|&lt;math&gt;p + q \equiv \overline{\overline{(p + q)} + \overline{(p + q)}}&lt;/math&gt;
|-
|&quot;''p'' implies ''q''&quot; is equivalent to &quot;((''p'' NNOR ''q'') NNOR ''q'') NNOR ((''p'' NNOR ''q'') NNOR ''q'')&quot;
|&lt;math&gt;p \rightarrow q \equiv \overline{\overline{(\overline{(p+q)} + q)}+\overline{(\overline{(p + q)} + q)}}&lt;/math&gt;
|}

The [[logical NAND]] or Sheffer stroke roperator also has this ability to express all logical operations.

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.

==See also==

===Logical operators===

{|
|+ &amp;nbsp;
| valign=top |
* [[Exclusive disjunction]]
* [[Logical conjunction]]
* [[Logical disjunction]]
* [[Logical equality]]
| valign=top |
* [[Logical implication]]
* [[Logical NAND]]
* [[Logical NNOR]]
* [[Negation]]
|}

===Related topics===

{|
|+ &amp;nbsp;
| valign=top |
* [[Ampheck]]
* [[Boolean algebra]]
* [[Boolean domain]]
* [[Boolean function]]
| valign=top |
* [[Boolean logic]]
* [[Laws of Form]]
* [[Logic gate]]
* [[Logical graph]]
| valign=top |
* [[Peirce's law]]
* [[Propositional calculus]]
* [[Sole sufficient operator]]
* [[Zeroth order logic]]
|}

----

&lt;!--  NOTE TO EDITORS: 
Per the GNU Free Documentation License, please include the live link below to the adapted Wikinfo article:
//--&gt;

''Some content adapted from the [[Wikinfo]] article &quot;[http://getwiki.net/url.php?wikinfo=Logical_NNOR Logical NNOR]&quot; under the [[GNU Free Documentation License]].''

[[Category:Logic]]
[[Category:Boolean algebra]]
[[Category:Binary operations]]

[[de:NOR-Gatter]]
[[es:Puerta lógica#Puerta NO-O (NOR)]]
[[he:NOR &amp;#1500;&amp;#1493;&amp;#1490;&amp;#1497;]]
[[ja:&amp;#21542;&amp;#23450;&amp;#35542;&amp;#29702;&amp;#21644;]]
[[nl:NOR-poort]]
[[no:Injunksjon]]
[[pl:NOR]]
[[ru:&amp;#1057;&amp;#1090;&amp;#1088;&amp;#1077;&amp;#1083;&amp;#1082;&amp;#1072; &amp;#1055;&amp;#1080;&amp;#1088;&amp;#1089;&amp;#1072;]]
[[tr:VEYADE&amp;#286;&amp;#304;L kap&amp;#305;s&amp;#305;]]</text>
    </revision>
  </page>
</getwiki>
