NAND logic
Logic constructed only from NAND gates
The NAND Boolean function has the property of functional completeness. This means that any Boolean expression can be re-expressed by an equivalent expression utilizing only NAND operations. For example, the function NOT(x) may be equivalently expressed as NAND(x,x).
Nº Q4116068 ★★
Uncommon · Knowledge
NAND logic
Logic constructed only from NAND gates
The NAND Boolean function has the property of functional completeness. This means that any Boolean expression can be re-expressed by an equivalent expression utilizing only NAND operations. For example, the function NOT(x) may be equivalently expressed as NAND(x,x).
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
The NAND Boolean function has the property of functional completeness. This means that any Boolean expression can be re-expressed by an equivalent expression utilizing only NAND operations. For example, the function NOT(x) may be equivalently expressed as NAND(x,x). In the field of digital electronic circuits, this implies that it is possible to implement any Boolean function using just NAND gates. The mathematical proof for this was published by Henry M. Sheffer in 1913 in the Transactions of the American Mathematical Society (Sheffer 1913). A similar case applies to the NOR function, and this is referred to as NOR logic.
Text: Wikipédia, CC BY-SA 4.0. · Image: Inductiveload (Public domain) ·
Related cards
-
Sheffer stroke
Logical operation that asserts that at least one of its operands is false
Nº Q3874243 ★★
Not listed
-
Logical NOR
Binary operation that is true if and only if both operands are false
Nº Q574946 ★★
Not listed
-
Boolean function
Any mathematical function with Boolean arguments and result
Nº Q942353 ★★★
Not listed
-
Transistor–transistor logic
Class of digital circuits built from bipolar junction transistors (BJTs) and resistors; transistors perform both the logic function (e.g. AND) and the amplifying function
Nº Q173451 ★★★
Not listed
-
Controlled NOT gate
Quantum logic gate that operates on 2 qubits, flipping the second qubit if and only if the first qubit is 1
Nº Q917713 ★
Not listed
-
NMOS logic
Implements logic gates and other digital circuits
Nº Q83908 ★
Not listed