Logical NAND
MyWikiBiz, Author Your Legacy — Thursday April 18, 2024
Revision as of 14:22, 21 May 2007 by Jon Awbrey (talk | contribs) (copy text from [http://www.opencycle.net/ OpenCycle] of which Jon Awbrey is the sole author)
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 |
