Sheffer stroke
Logical operation that asserts that at least one of its operands is false
In Boolean functions and propositional calculus, the Sheffer stroke denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both". It is also called non-conjunction, alternative denial (since it says in effect that at least one of its operands is false), or NAND ("not and").
Nº Q3874243 ★★
Uncommon · Knowledge
Sheffer stroke
Logical operation that asserts that at least one of its operands is false
In Boolean functions and propositional calculus, the Sheffer stroke denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both". It is also called non-conjunction, alternative denial (since it says in effect that at least one of its operands is false), or NAND ("not and").
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
In Boolean functions and propositional calculus, the Sheffer stroke denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both". It is also called non-conjunction, alternative denial (since it says in effect that at least one of its operands is false), or NAND ("not and"). In digital electronics, it corresponds to the NAND gate. It is named after Henry Maurice Sheffer and written as ∣ {\displaystyle \mid } or as ↑ {\displaystyle \uparrow } or as ∧ ¯ {\displaystyle {\overline {\wedge }}} or as D p q {\displaystyle Dpq} in Polish notation by Łukasiewicz (but not as ||, often used to represent disjunction). Its dual is the NOR operator (also known as the Peirce arrow, Quine dagger or Webb operator). Like its dual, NAND can be used by itself, without any other logical operator, to constitute a logical formal system (making NAND functionally complete). This property makes the NAND gate crucial to modern digital electronics, including its use in computer processor design.
Text: Wikipédia, CC BY-SA 4.0. · Image: Wikimedia Commons (Public domain) ·
Related cards
NAND logic
Logic constructed only from NAND gates
Nº Q4116068 ★★
Negation
Operation that takes a proposition p to another proposition "not p", written ¬p, which is interpreted intuitively as being true when p is false, and false when p is true; unary (single-argument) logical connective
Nº Q190558 ★★
Logical conjunction
Logical connective AND
Nº Q191081 ★★★
Exclusive or
True when either but not both inputs are true
Nº Q498186 ★★★
If and only if
Logical connective
Nº Q949972 ★★★
Logical disjunction
Logical connective OR
Nº Q1651704 ★★★