Sheffer stroke

Known as: Logical nand, Sheffers stroke, Sheffer's stroke 
In Boolean functions and propositional calculus, the Sheffer stroke, named after Henry M. Sheffer, written "|" (see vertical bar, not to be confused… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2016
012319662016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In CRYPTO 2008, one year earlier than Gentry’s pioneering “bootstrapping” technique on constructing the first fully homomorphic… (More)
  • table 1
Is this relevant?
2010
2010
Security is not merely about technical solutions and patching vulnerabilities. Security is about trade-offs and adhering to… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
We formalized another axiomatization of Boolean algebras. The classical one is introduced in [9], “the fourth set of postulates… (More)
Is this relevant?
2007
2007
Let L be a non empty Sheffer structure. We say that L satisfies (Sh1) if and only if: (Def. 1) For all elements x, y, z of L… (More)
Is this relevant?
2003
2003
In this article, we present a short 2-basis for Boolean algebra in terms of the Sheffer stroke and prove that no such 2-basis can… (More)
Is this relevant?
2001
2001
In this article, we describe a set of procedures and strategies for searching for proofs in logical systems based on the… (More)
Is this relevant?
2000
2000
A short Sheffer stroke identity is shown to be a single axiom for Boolean algebra. The axiom has length 15 and 3 variables. The… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
  • Willard Van Orman Quine
  • 2000
algebra 81; entities; 311, 45,<lb>73: terms 21. 30. 76. 78. Set: also<lb>Attribute, Class, hame<lb>Abstraction: of attributes 76… (More)
Is this relevant?
1997
1997
The use of DNA molecules to solve hard computational problems has been demonstrated in recent studies. However, the question of… (More)
  • table 1
  • table 1
  • table 2
Is this relevant?
1977
1977
  • Jon C. Muzio
  • International Journal of Computer & Information…
  • 1977
A new notation for a NAND operator is proposed, based on the prefix Polish notation following the style of Lukasiewicz. There is… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 6
Is this relevant?