
related topics 
{math, number, function} 
{system, computer, user} 
{@card@, make, design} 
{style, bgcolor, rowspan} 
{acid, form, water} 
{language, word, form} 
{theory, work, human} 
{food, make, wine} 
{son, year, death} 

In Boolean functions and propositional calculus, the Sheffer stroke, named after Henry M. Sheffer, written "" (see vertical bar) or "↑", 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 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 ("not and").
Like its dual, the NOR operator (a.k.a. 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.
Contents
Definition
The NAND operation is a logical operation on two logical values, typically the values of two propositions, that produces a value of false if and only if both of its operands are true. In other words, it produces a value of true if and only if at least one of its operands is false.
Full article ▸


related documents 
Integer (computer science) 
Normal space 
Bspline 
Topological vector space 
Partially ordered set 
A* search algorithm 
Ordered pair 
Graph theory 
Banach space 
Haskell (programming language) 
Pseudorandom number generator 
Universal quantification 
Associative array 
Direct product 
Optimization (mathematics) 
Document Type Definition 
NP (complexity) 
Free group 
Empty set 
Net (mathematics) 
Greatest common divisor 
Polish notation 
Minimum spanning tree 
Stokes' theorem 
Henri Lebesgue 
Algebraically closed field 
Binomial theorem 
Affine transformation 
Grover's algorithm 
LL parser 
