Difference between revisions of "Logical NAND"
MyWikiBiz, Author Your Legacy — Thursday November 21, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) (+ cats) |
||
| Line 79: | Line 79: | ||
<br><sharethis /> | <br><sharethis /> | ||
| + | [[Category:Inquiry]] | ||
| + | [[Category:Open Educational Resource]] | ||
| + | [[Category:Peer Educational Resource]] | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
[[Category:Formal Languages]] | [[Category:Formal Languages]] | ||
Revision as of 20:00, 14 May 2010
☞ This page belongs to resource collections on Logic and Inquiry.
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 />
