Logical NAND
From semanticweb.org
☞ 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 |
Contents |
[edit] Syllabus
[edit] Focal nodes
[edit] Peer nodes
[edit] Logical operators
|
[edit] Related topics
[edit] Relational concepts
[edit] Information, Inquiry
[edit] Related articles
[edit] 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.
