Logical NAND - Revision history

Jon Awbrey: update

2015-11-04T22:56:18Z

update

Jon Awbrey at 15:26, 16 May 2012

2012-05-16T15:26:53Z

Jon Awbrey at 13:18, 16 May 2012

2012-05-16T13:18:12Z

Jon Awbrey: /* Peer nodes */ update

2012-05-15T14:34:05Z

Peer nodes: update

Jon Awbrey: comma

2012-05-15T14:30:12Z

comma

Jon Awbrey: TeX

2012-05-15T14:26:02Z

TeX

Jon Awbrey: Category:Charles Sanders Peirce

2011-11-02T01:03:22Z

Category:Charles Sanders Peirce

Jon Awbrey: /* Information, Inquiry */

2010-05-23T11:23:24Z

Information, Inquiry

Jon Awbrey: /* Syllabus */ update

2010-05-22T03:54:04Z

Syllabus: update

Jon Awbrey: fix link

2010-05-15T23:42:41Z

fix link

@@ Line 29: / Line 29: @@
 ===Focal nodes===
 * [[Inquiry Live]]
 * [[Logic Live]]
 ===Peer nodes===
-{{col-begin}}
+* [http://intersci.ss.uci.edu/wiki/index.php/Logical_NAND Logical NAND @ InterSciWiki]
 * [http://mywikibiz.com/Logical_NAND Logical NAND @ MyWikiBiz]
 * [http://ref.subwiki.org/wiki/Logical_NAND Logical NAND @ Subject Wikis]
 * [http://beta.wikiversity.org/wiki/Logical_NAND Logical NAND @ Wikiversity Beta]
 ===Logical operators===
@@ Line 126: / Line 117: @@
 ===Related articles===
-* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Semiotic_Information Jon Awbrey, &ldquo;Semiotic Information&rdquo;]
+{{col-begin}}
+{{col-break}}
-* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Introduction_to_Inquiry_Driven_Systems Jon Awbrey, &ldquo;Introduction To Inquiry Driven Systems&rdquo;]
+* [http://intersci.ss.uci.edu/wiki/index.php/Cactus_Language Cactus Language]
+* [http://intersci.ss.uci.edu/wiki/index.php/Futures_Of_Logical_Graphs Futures Of Logical Graphs]
-* [http://mywikibiz.com/Directory:Jon_Awbrey/Essays/Prospects_For_Inquiry_Driven_Systems Jon Awbrey, &ldquo;Prospects For Inquiry Driven Systems&rdquo;]
+* [http://intersci.ss.uci.edu/wiki/index.php/Propositional_Equation_Reasoning_Systems Propositional Equation Reasoning Systems]
+{{col-break}}
-* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Inquiry_Driven_Systems Jon Awbrey, &ldquo;Inquiry Driven Systems : Inquiry Into Inquiry&rdquo;]
+* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_:_Introduction Differential Logic : Introduction]
+* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Propositional_Calculus Differential Propositional Calculus]
-* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Propositional_Equation_Reasoning_Systems Jon Awbrey, &ldquo;Propositional Equation Reasoning Systems&rdquo;]
+* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_and_Dynamic_Systems_2.0 Differential Logic and Dynamic Systems]
+{{col-break}}
-* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Differential_Logic_:_Introduction Jon Awbrey, &ldquo;Differential Logic : Introduction&rdquo;]
+* [http://intersci.ss.uci.edu/wiki/index.php/Prospects_for_Inquiry_Driven_Systems Prospects for Inquiry Driven Systems]
+* [http://intersci.ss.uci.edu/wiki/index.php/Introduction_to_Inquiry_Driven_Systems Introduction to Inquiry Driven Systems]
-* [http://planetmath.org/encyclopedia/DifferentialPropositionalCalculus.html Jon Awbrey, &ldquo;Differential Propositional Calculus&rdquo;]
+* [http://intersci.ss.uci.edu/wiki/index.php/Inquiry_Driven_Systems Inquiry Driven Systems : Inquiry Into Inquiry]
+{{col-end}}
 ==Document history==
@@ Line 146: / Line 136: @@
 Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders.
-{{col-begin}}
+* [http://intersci.ss.uci.edu/wiki/index.php/Logical_NAND Logical NAND], [http://intersci.ss.uci.edu/ InterSciWiki]
 * [http://mywikibiz.com/Logical_NAND Logical NAND], [http://mywikibiz.com/ MyWikiBiz]
 * [http://beta.wikiversity.org/wiki/Logical_NAND Logical NAND], [http://beta.wikiversity.org/ Wikiversity Beta]
 * [http://en.wikipedia.org/w/index.php?title=Logical_NAND&oldid=75155132 Logical NAND], [http://en.wikipedia.org/ Wikipedia]
 [[Category:Inquiry]]

@@ Line 156: / Line 156: @@
 * [http://en.wikipedia.org/w/index.php?title=Logical_NAND&oldid=75155132 Logical NAND], [http://en.wikipedia.org/ Wikipedia]
 {{col-end}}
 [[Category:Inquiry]]

@@ Line 1: / Line 1: @@
 <font size="3">&#9758;</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]].
-The '''logical NAND''' is an operation on two logical values, typically the values of two [[proposition]]s, that produces a value of ''false'' if and only if both of its operands are true.  In other words, it produces a value of ''true'' if and only if at least one of its operands is false.
+The '''logical NAND''' is an operation on two logical values, typically the values of two propositions, that produces a value of ''false'' if and only if both of its operands are true.  In other words, it produces a value of ''true'' if and only if at least one of its operands is false.
 The [[truth table]] of <math>p ~\operatorname{NAND}~ q,</math> also written <math>p \stackrel{\circ}{\curlywedge} q\!</math> or <math>p \barwedge q,\!</math> appears below:

@@ Line 41: / Line 41: @@
 {{col-break}}
 * [http://mywikibiz.com/Logical_NAND Logical NAND @ MyWikiBiz]
-* [http://mathweb.org/wiki/Logical_NAND Logical NAND @ MathWeb Wiki]
+* [http://intersci.ss.uci.edu/wiki/index.php/Logical_NAND Logical NAND @ InterSciWiki]
-* [http://netknowledge.org/wiki/Logical_NAND Logical NAND @ NetKnowledge]
+* [http://wiki.oercommons.org/mediawiki/index.php/Logical_NAND Logical NAND @ OER Commons]
 {{col-break}}
 * [http://p2pfoundation.net/Logical_NAND Logical NAND @ P2P Foundation]
-* [http://semanticweb.org/wiki/Logical_NAND Logical NAND @ SemanticWeb]
+* [http://ref.subwiki.org/wiki/Logical_NAND Logical NAND @ Subject Wikis]
 {{col-end}}

@@ Line 3: / Line 3: @@
 The '''logical NAND''' is an operation on two logical values, typically the values of two [[proposition]]s, that produces a value of ''false'' if and only if both of its operands are true.  In other words, it produces a value of ''true'' if and only if at least one of its operands is false.
-The [[truth table]] of <math>p ~\operatorname{NAND}~ q,</math> also written <math>p \stackrel{\circ}{\curlywedge} q\!</math> or <math>p \barwedge q\!</math> appears below:
+The [[truth table]] of <math>p ~\operatorname{NAND}~ q,</math> also written <math>p \stackrel{\circ}{\curlywedge} q\!</math> or <math>p \barwedge q,\!</math> appears below:
 <br>

@@ Line 1: / Line 1: @@
 <font size="3">&#9758;</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]].
-The '''logical NAND''' is a [[logical operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''false'' if and only if both of its operands are true.  In other words, it produces a value of ''true'' if and only if at least one of its operands is false.
+The '''logical NAND''' is an operation on two logical values, typically the values of two [[proposition]]s, that produces a value of ''false'' if and only if both of its operands are true.  In other words, it produces a value of ''true'' if and only if at least one of its operands is false.
-The [[truth table]] of '''p NAND q''' (also written as '''p&nbsp;|&nbsp;q''' or '''p&nbsp;&uarr;&nbsp;q''') is as follows:
+The [[truth table]] of <math>p ~\operatorname{NAND}~ q,</math> also written <math>p \stackrel{\circ}{\curlywedge} q\!</math> or <math>p \barwedge q\!</math> appears below:
 <br>
-{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:#f8f8ff; font-weight:bold; text-align:center; width:45%"
+{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:45%"
-|+ '''Logical NAND'''
+|+ style="height:30px" | <math>\text{Logical NAND}\!</math>
-|- style="background:#e6e6ff"
+|- style="height:40px; background:#f0f0ff"
-! style="width:15%" | p
+| style="width:33%" | <math>p\!</math>
-! style="width:15%" | q
+| style="width:33%" | <math>q\!</math>
-! style="width:15%" | p &uarr; q
+| style="width:33%" | <math>p \stackrel{\circ}{\curlywedge} q\!</math>
 |-
-| F || F || T
+| <math>\operatorname{F}</math> || <math>\operatorname{F}</math> || <math>\operatorname{T}</math>
 |-
-| F || T || T
+| <math>\operatorname{F}</math> || <math>\operatorname{T}</math> || <math>\operatorname{T}</math>
 |-
-| T || F || T
+| <math>\operatorname{T}</math> || <math>\operatorname{F}</math> || <math>\operatorname{T}</math>
 |-
-| T || T || F
+| <math>\operatorname{T}</math> || <math>\operatorname{T}</math> || <math>\operatorname{F}</math>
 |}

@@ Line 162: / Line 162: @@
 [[Category:Open Educational Resource]]
 [[Category:Peer Educational Resource]]
 [[Category:Computer Science]]
 [[Category:Formal Languages]]

@@ Line 121: / Line 121: @@
 {{col-break}}
 * [[Pragmatic maxim]]
-* [[Pragmatic theory of truth]]
+* [[Truth theory]]
 {{col-end}}

@@ Line 152: / Line 152: @@
 * [http://wikinfo.org/index.php/Logical_NAND Logical NAND], [http://wikinfo.org/ Wikinfo]
 * [http://textop.org/wiki/index.php?title=Logical_NAND Logical NAND], [http://textop.org/wiki/ Textop Wiki]
-* [http://en.wikipedia.org/w/index.php?title=Sheffer_stroke&oldid=75155132 Logical NAND], [http://en.wikipedia.org/ Wikipedia]
+* [http://en.wikipedia.org/w/index.php?title=Logical_NAND&oldid=75155132 Logical NAND], [http://en.wikipedia.org/ Wikipedia]
 {{col-end}}