Sheffer stroke
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 nand ("not and") or the alternative denial, since it says in effect that at least one of its operands is false. In digital electronics, it corresponds to the NAND gate. It is named after Henry M. Sheffer and written as ↑ or as | (but not as ||, often used to represent disjunction). In Bocheński notation it can be written as Dpq.
Wikipage disambiguates
APL (programming language)APL syntax and symbolsAlternative denialAxiom of reducibilityBitwise operationBoolean algebraBoolean algebras canonically definedBoolean functionCMOSCircuit satisfiability problemDEC AlphaFirst-order logicFunctional completenessGlossary of Principia MathematicaHenry M. ShefferHistory of computer scienceHistory of computingHistory of logicHistory of type theoryInclusive nandIndex of logic articlesIndex of philosophy articles (A–C)Index of philosophy articles (R–Z)Intuitionistic logicJean NicodJosiah RoyceJózef Maria BocheńskiLaws of FormList of Boolean algebra topicsList of Hilbert systemsList of logic symbolsList of mathematical abbreviationsList of rules of inferenceList of terms relating to algorithms and data structuresLogic alphabetLogic gateLogical NANDLogical NORLogical connectiveLogical nand
Link from a Wikipage to another Wikipage
primaryTopic
Sheffer stroke
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 nand ("not and") or the alternative denial, since it says in effect that at least one of its operands is false. In digital electronics, it corresponds to the NAND gate. It is named after Henry M. Sheffer and written as ↑ or as | (but not as ||, often used to represent disjunction). In Bocheński notation it can be written as Dpq.
has abstract
Dysjunkcja, dyzjunkcja, dysjun ...... natomiast alternative denial.
@pl
En calcul de propositions, la ...... d'un processeur d'ordinateur.
@fr
En razonamiento formal, una co ...... lementa la conjunción opuesta.
@es
In Boolean functions and propo ...... in computer processor design.
@en
L'operatore di Sheffer, chiama ...... o a quella della congiunzione.
@it
Sheffers streck är ett logiskt ...... s funktionen av en NAND-grind.
@sv
Штрих Ше́ффера (NAND, отрицани ...... ах принято другое обозначение:
@ru
Штрих Шеффера (операція NAND) ...... перацію логічний вентиль І-НЕ.
@uk
否定論理積（ひていろんりせき）とは、与えられた複数の命題のう ...... 、記号 "|" で表す）や矢印の「↑」を用いる表記法もある。
@ja
谢费尔竖线（英語：Sheffer stroke），得名于，写 ...... 子之一。在布尔代数和数字电子中有叫做「NAND」的等价运算。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,024,541,231
Link from a Wikipage to another Wikipage
0-preserving
no
@en
1-preserving
no
@en
affine
no
@en
logic gate
@en
monotone
no
@en
other titles
NAND
@en
self-dual
no
@en
title
Sheffer stroke
@en
Venn diagram
@en
wikiPageUsesTemplate
comment
Dysjunkcja, dyzjunkcja, dysjun ...... natomiast alternative denial.
@pl
En calcul de propositions, la ...... le nom de l'opération NON-ET.
@fr
En razonamiento formal, una co ...... olizar una conjunción opuesta.
@es
In Boolean functions and propo ...... tion it can be written as Dpq.
@en
L'operatore di Sheffer, chiama ...... o a quella della congiunzione.
@it
Sheffers streck är ett logiskt ...... s funktionen av en NAND-grind.
@sv
Штрих Ше́ффера (NAND, отрицани ...... ах принято другое обозначение:
@ru
Штрих Шеффера (операція NAND) ...... перацію логічний вентиль І-НЕ.
@uk
否定論理積（ひていろんりせき）とは、与えられた複数の命題のう ...... 、記号 "|" で表す）や矢印の「↑」を用いる表記法もある。
@ja
谢费尔竖线（英語：Sheffer stroke），得名于，写 ...... 子之一。在布尔代数和数字电子中有叫做「NAND」的等价运算。
@zh
label
Barre de Sheffer
@fr
Conjunción opuesta
@es
Dysjunkcja (Sheffera)
@pl
Operatore di Sheffer
@it
Sheffer stroke
@en
Sheffers streck
@sv
Shefferscher Strich
@de
Штрих Шефера
@uk
Штрих Шеффера
@ru
否定論理積
@ja