Difference between revisions of "Logical NAND"
MyWikiBiz, Author Your Legacy — Saturday November 23, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (→Syllabus: update) |
Jon Awbrey (talk | contribs) |
||
| Line 121: | Line 121: | ||
{{col-break}} | {{col-break}} | ||
* [[Pragmatic maxim]] | * [[Pragmatic maxim]] | ||
| − | * [[ | + | * [[Truth theory]] |
{{col-end}} | {{col-end}} | ||
Revision as of 11:23, 23 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
Focal nodes
Template:Col-breakTemplate:Col-breakTemplate:Col-endPeer nodes
Logical operators
Related topics
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
Relational concepts
Information, Inquiry
Related articles
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 />
