Difference between revisions of "Logical NAND"
MyWikiBiz, Author Your Legacy — Sunday November 24, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (table colors → table body (#f8f8ff = ghostwhite) table head (#e6e6ff = blue gray)) |
Jon Awbrey (talk | contribs) (standardize syllabus + document history) |
||
| Line 23: | Line 23: | ||
<br> | <br> | ||
| − | == | + | ==Syllabus== |
===Logical operators=== | ===Logical operators=== | ||
| Line 45: | Line 45: | ||
{{col-break}} | {{col-break}} | ||
* [[Ampheck]] | * [[Ampheck]] | ||
| − | |||
* [[Boolean domain]] | * [[Boolean domain]] | ||
* [[Boolean function]] | * [[Boolean function]] | ||
| + | * [[Boolean-valued function]] | ||
{{col-break}} | {{col-break}} | ||
| − | |||
| − | |||
| − | |||
* [[Logical graph]] | * [[Logical graph]] | ||
| + | * [[Logical matrix]] | ||
| + | * [[Minimal negation operator]] | ||
| + | * [[Peirce's law]] | ||
{{col-break}} | {{col-break}} | ||
| − | |||
* [[Propositional calculus]] | * [[Propositional calculus]] | ||
| − | * [[ | + | * [[Truth table]] |
| + | * [[Universe of discourse]] | ||
* [[Zeroth order logic]] | * [[Zeroth order logic]] | ||
{{col-end}} | {{col-end}} | ||
| + | |||
| + | ==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. | ||
| + | |||
| + | {{col-begin}} | ||
| + | {{col-break}} | ||
| + | * [http://mywikibiz.com/Logical_NAND Logical NAND], [http://mywikibiz.com/ MyWikiBiz] | ||
| + | * [http://beta.wikiversity.org/wiki/Logical_NAND Logical NAND], [http://beta.wikiversity.org/ Beta Wikiversity] | ||
| + | * [http://www.getwiki.net/-Logical_NAND Logical NAND], [http://www.getwiki.net/ GetWiki] | ||
| + | {{col-break}} | ||
| + | * [http://www.wikinfo.org/index.php/Logical_NAND Logical NAND], [http://www.wikinfo.org/ Wikinfo] | ||
| + | * [http://www.textop.org/wiki/index.php?title=Logical_NAND Logical NAND], [http://www.textop.org/wiki/ Textop Wiki] | ||
| + | * [http://en.wikipedia.org/w/index.php?title=Sheffer_stroke&oldid=75155132 Logical NAND], [http://en.wikipedia.org/ Wikipedia] | ||
| + | {{col-end}} | ||
| + | |||
| + | <br><sharethis /> | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
| Line 69: | Line 86: | ||
[[Category:Philosophy]] | [[Category:Philosophy]] | ||
[[Category:Semiotics]] | [[Category:Semiotics]] | ||
| − | |||
| − | |||
Revision as of 23:45, 6 April 2010
The logical NAND is a logical 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 NAND q (also written as p | q or p ↑ q) is as follows:
| p | q | p ↑ q |
|---|---|---|
| F | F | T |
| F | T | T |
| T | F | T |
| T | T | F |
Syllabus
Logical operators
Template:Col-breakTemplate:Col-breakTemplate:Col-endRelated topics
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.
<sharethis />
