Difference between revisions of "Logical NAND"
MyWikiBiz, Author Your Legacy — Friday November 22, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (copy text from [http://www.opencycle.net/ OpenCycle] of which Jon Awbrey is the sole author) |
Jon Awbrey (talk | contribs) (+ {{aficionados}} <sharethis /> + categories) |
||
| Line 52: | Line 52: | ||
* [[Zeroth order logic]] | * [[Zeroth order logic]] | ||
|} | |} | ||
| + | |||
| + | {{aficionados}}<sharethis /> | ||
| + | |||
| + | [[Category:Computer Science]] | ||
| + | [[Category:Formal Languages]] | ||
| + | [[Category:Formal Sciences]] | ||
| + | [[Category:Formal Systems]] | ||
| + | [[Category:Linguistics]] | ||
| + | [[Category:Logic]] | ||
| + | [[Category:Mathematics]] | ||
| + | [[Category:Philosophy]] | ||
| + | [[Category:Semiotics]] | ||
Revision as of 14:40, 21 May 2007
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 |
See also
Logical operators
Related topics
Aficionados
- See Talk:Logical NAND for discussions/comments regarding this article.
- See Logical NAND/Aficionados for those who have listed Logical NAND as an interest.
- See Talk:Logical NAND/Aficionados for discussions regarding this interest.
<sharethis />
