World Library  
Flag as Inappropriate
Email this Article

Sheffer stroke

Article Id: WHEBN0000029388
Reproduction Date:

Title: Sheffer stroke  
Author: World Heritage Encyclopedia
Language: English
Subject: Principia Mathematica, Vector logic, Logical connective, Boolean algebras canonically defined, List of logic symbols
Collection: Logic Gates, Logic Symbols, Logical Connectives
Publisher: World Heritage Encyclopedia

Sheffer stroke

Venn diagram of ~A \uparrow B

In Boolean functions and propositional calculus, the Sheffer stroke, named after Henry M. Sheffer, written "|" (see vertical bar, not to be confused with "||" which is often used to represent disjunction), "Dpq", or "↑" (an upwards arrow), 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 Boolean algebra and digital electronics it is known as the NAND operation.

Like its dual, the NOR operator (also known as the Peirce arrow or Quine dagger), 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 NAND flash memory and computer processor design.


  • Definition 1
    • Truth table 1.1
  • History 2
  • Properties 3
  • Introduction, elimination, and equivalencies 4
  • Formal system based on the Sheffer stroke 5
    • Symbols 5.1
    • Syntax 5.2
    • Calculus 5.3
    • Simplification 5.4
  • See also 6
  • Notes 7
  • References 8
  • External links 9


The NAND operation is a logical operation on two logical values. It produces a value of true, if — and only if — at least one of the propositions is false.

Truth table

The truth table of A NAND B (also written as A | B, Dpq, or A ↑ B) is as follows:

0 0 1
0 1 1
1 0 1
1 1 0


The stroke is named after Henry M. Sheffer, who in 1913 published a paper in the Transactions of the American Mathematical Society (Sheffer 1913) providing an axiomatization of Boolean algebras using the stroke, and proved its equivalence to a standard formulation thereof by Huntington employing the familiar operators of propositional logic (and, or, not). Because of self-duality of Boolean algebras, Sheffer's axioms are equally valid for either of the NAND or NOR operations in place of the stroke. Sheffer interpreted the stroke as a sign for non-disjunction (NOR) in his paper, mentioning non-conjunction only in a footnote and without a special sign for it. It was Jean Nicod who first used the stroke as a sign for non-conjunction (NAND) in a paper of 1917 and which has since become current practice.[1] Russell and Whitehead used the Sheffer stroke in the 1927 second edition of Principia Mathematica and suggested it as a replacement for the "or" and "not" operations of the first edition.

Charles Sanders Peirce (1880) had discovered the functional completeness of NAND or NOR more than 30 years earlier, using the term ampheck (for 'cutting both ways'), but he never published his finding.


NAND does not possess any of the following five properties, each of which is required to be absent from, and the absence of all of which is sufficient for, at least one member of a set of functionally complete operators: truth-preservation, falsity-preservation, linearity, monotonicity, self-duality. (An operator is truth- (falsity-) preserving if its value is truth (falsity) whenever all of its arguments are truth (falsity).) Therefore {NAND} is a functionally complete set.

This can also be realized as follows: All three elements of the functionally complete set {AND, OR, NOT} can be constructed using only NAND. Thus the set {NAND} must be functionally complete as well.

Introduction, elimination, and equivalencies

The Sheffer stroke \uparrow is the negation of the conjunction:

P \uparrow Q     \Leftrightarrow     \neg (P \and Q)
    \Leftrightarrow     \neg

Expressed in terms of NAND \uparrow, the usual operators of propositional logic are:

\neg P     \Leftrightarrow     P \uparrow P
    \Leftrightarrow     \uparrow
P \rightarrow Q     \Leftrightarrow     ~P \uparrow (Q \uparrow Q)     \Leftrightarrow     ~P \uparrow (P \uparrow Q)
    \Leftrightarrow     \uparrow     \Leftrightarrow     \uparrow
P \and Q     \Leftrightarrow     (P \uparrow Q) \uparrow (P \uparrow Q)
    \Leftrightarrow     \uparrow
P \or Q     \Leftrightarrow     (P \uparrow P) \uparrow (Q \uparrow Q)
    \Leftrightarrow     \uparrow

Formal system based on the Sheffer stroke

The following is an example of a formal system based entirely on the Sheffer stroke, yet having the functional expressiveness of the propositional logic:


pn for natural numbers n
( | )

The Sheffer stroke commutes but does not associate (e.g., (T|T)|F = T, but T|(T|F) = F). Hence any formal system including the Sheffer stroke must also include a means of indicating grouping. We shall employ '(' and ')' to this effect.

We also write p, q, r, … instead of p0, p1, p2.


Construction Rule I: For each natural number n, the symbol pn is a well-formed formula (wff), called an atom.

Construction Rule II: If X and Y are wffs, then (X|Y) is a wff.

Closure Rule: Any formulae which cannot be constructed by means of the first two Construction Rules are not wffs.

The letters U, V, W, X, and Y are metavariables standing for wffs.

A decision procedure for determining whether a formula is well-formed goes as follows: "deconstruct" the formula by applying the Construction Rules backwards, thereby breaking the formula into smaller subformulae. Then repeat this recursive deconstruction process to each of the subformulae. Eventually the formula should be reduced to its atoms, but if some subformula cannot be so reduced, then the formula is not a wff.


All wffs of the form


are axioms. Instances of

(U|(V|W)), U \vdash W

are inference rules.


Since the only connective of this logic is |, the symbol | could be discarded altogether, leaving only the parentheses to group the letters. A pair of parentheses must always enclose a pair of wffs. Examples of theorems in this simplified notation are


The notation can be simplified further, by letting

(U) := (UU)
((U)) \equiv U

for any U. This simplification causes the need to change some rules:

  1. More than two letters are allowed within parentheses.
  2. Letters or wffs within parentheses are allowed to commute.
  3. Repeated letters or wffs within a same set of parentheses can be eliminated.

The result is a parenthetical version of the Peirce existential graphs.

Another way to simplify the notation is to eliminate parenthesis by using Polish Notation. For example, the earlier examples with only parenthesis could be rewritten using only strokes as follows

(p(p(q(q((pq)(pq)))))) becomes
|p|p|q|q||pq|pq, and
(p(p((qq)(pp)))) becomes,

This follows the same rules as the parenthesis version, with opening parenthesis replaced with a Sheffer stroke and the (redundant) closing parenthesis removed.

See also


  1. ^ Church (1956:134)


External links

  • implementations of 2 and 4-input NAND gates
  • Proofs of some axioms by Stroke function by Yasuo Setô @ Project Euclid
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.