Difference between revisions of "Logical NAND"
MyWikiBiz, Author Your Legacy — Friday November 29, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) (update) |
||
(5 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
<font size="3">☞</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]]. | <font size="3">☞</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]]. | ||
− | The '''logical NAND''' is | + | 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 | + | 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> | <br> | ||
− | {| align="center" border="1" cellpadding="8" cellspacing="0" style=" | + | {| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:45%" |
− | |+ | + | |+ style="height:30px" | <math>\text{Logical NAND}\!</math> |
− | |- style="background:# | + | |- style="height:40px; background:#f0f0ff" |
− | + | | style="width:33%" | <math>p\!</math> | |
− | + | | style="width:33%" | <math>q\!</math> | |
− | + | | 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 29: | Line 29: | ||
===Focal nodes=== | ===Focal nodes=== | ||
− | |||
− | |||
* [[Inquiry Live]] | * [[Inquiry Live]] | ||
− | |||
* [[Logic Live]] | * [[Logic Live]] | ||
− | |||
===Peer nodes=== | ===Peer nodes=== | ||
− | + | * [http://intersci.ss.uci.edu/wiki/index.php/Logical_NAND Logical NAND @ InterSciWiki] | |
− | |||
* [http://mywikibiz.com/Logical_NAND Logical NAND @ MyWikiBiz] | * [http://mywikibiz.com/Logical_NAND Logical NAND @ MyWikiBiz] | ||
− | * [http:// | + | * [http://ref.subwiki.org/wiki/Logical_NAND Logical NAND @ Subject Wikis] |
− | + | * [http://en.wikiversity.org/wiki/Logical_NAND Logical NAND @ Wikiversity] | |
− | + | * [http://beta.wikiversity.org/wiki/Logical_NAND Logical NAND @ Wikiversity Beta] | |
− | * [http:// | ||
− | * [http:// | ||
− | |||
− | |||
===Logical operators=== | ===Logical operators=== | ||
Line 126: | Line 117: | ||
===Related articles=== | ===Related articles=== | ||
− | * [http:// | + | {{col-begin}} |
− | + | {{col-break}} | |
− | * [http:// | + | * [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:// | + | * [http://intersci.ss.uci.edu/wiki/index.php/Propositional_Equation_Reasoning_Systems Propositional Equation Reasoning Systems] |
− | + | {{col-break}} | |
− | * [http:// | + | * [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:// | + | * [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_and_Dynamic_Systems_2.0 Differential Logic and Dynamic Systems] |
− | + | {{col-break}} | |
− | * [http:// | + | * [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:// | + | * [http://intersci.ss.uci.edu/wiki/index.php/Inquiry_Driven_Systems Inquiry Driven Systems : Inquiry Into Inquiry] |
− | + | {{col-end}} | |
− | * [http:// | ||
==Document history== | ==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. | 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. | ||
− | + | * [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://mywikibiz.com/Logical_NAND Logical NAND], [http://mywikibiz.com/ MyWikiBiz] | ||
+ | * [http://wikinfo.org/w/index.php/Logical_NAND Logical NAND], [http://wikinfo.org/w/ Wikinfo] | ||
+ | * [http://en.wikiversity.org/wiki/Logical_NAND Logical NAND], [http://en.wikiversity.org/ Wikiversity] | ||
* [http://beta.wikiversity.org/wiki/Logical_NAND Logical NAND], [http://beta.wikiversity.org/ Wikiversity Beta] | * [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] | * [http://en.wikipedia.org/w/index.php?title=Logical_NAND&oldid=75155132 Logical NAND], [http://en.wikipedia.org/ Wikipedia] | ||
− | |||
− | |||
− | |||
[[Category:Inquiry]] | [[Category:Inquiry]] |
Latest revision as of 22:56, 4 November 2015
☞ This page belongs to resource collections on Logic and Inquiry.
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 \(p ~\operatorname{NAND}~ q,\) also written \(p \stackrel{\circ}{\curlywedge} q\!\) or \(p \barwedge q,\!\) appears below:
\(p\!\) | \(q\!\) | \(p \stackrel{\circ}{\curlywedge} q\!\) |
\(\operatorname{F}\) | \(\operatorname{F}\) | \(\operatorname{T}\) |
\(\operatorname{F}\) | \(\operatorname{T}\) | \(\operatorname{T}\) |
\(\operatorname{T}\) | \(\operatorname{F}\) | \(\operatorname{T}\) |
\(\operatorname{T}\) | \(\operatorname{T}\) | \(\operatorname{F}\) |
Syllabus
Focal nodes
Peer nodes
- Logical NAND @ InterSciWiki
- Logical NAND @ MyWikiBiz
- Logical NAND @ Subject Wikis
- Logical NAND @ Wikiversity
- Logical NAND @ Wikiversity Beta
Logical operators
Template:Col-breakTemplate:Col-breakTemplate:Col-endRelated topics
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
Relational concepts
Information, Inquiry
Related articles
- Differential Logic : Introduction
- Differential Propositional Calculus
- Differential Logic and Dynamic Systems
- Prospects for Inquiry Driven Systems
- Introduction to Inquiry Driven Systems
- Inquiry Driven Systems : Inquiry Into Inquiry
Document history
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.
- Logical NAND, InterSciWiki
- Logical NAND, MyWikiBiz
- Logical NAND, Wikinfo
- Logical NAND, Wikiversity
- Logical NAND, Wikiversity Beta
- Logical NAND, Wikipedia