We use rules to think.
One rule is "not both." It means one thing is false. This rule helps computers work. It is in every computer. We use it every day. Do you like computers?
Think about the rule "not both."
It means at least one thing is false. This rule is very special. It can build many other rules. One man named Henry Sheffer wrote about it.
This rule helps computers work. It is used to design computer parts. These parts are called gates. This helps our machines think. It is a big part of modern tools.
Imagine you have two rules. One rule is "both are true." The Sheffer stroke is the opposite. It is the "not both" rule.
This rule says at least one part is false. We call this NAND.
This rule is very powerful. It is called functionally complete. This means you can use it to make any other logic rule. You do not need other tools to build a whole system. Because of this, it is vital for computers. It helps design computer processors.
In electronics, we call this a NAND gate.
A man named Henry Maurice Sheffer wrote about this in 1913. He showed how it could work with other math ideas. Before him, Charles Peirce found this secret. But Peirce did not publish his work. Later, Jean Nicod began using the symbol for the stroke. Many famous thinkers used it too. They used it to help build math systems. The stroke is a tiny tool that does a big job.
Logic helps us decide if a statement is true or false. The Sheffer stroke is a special tool for this. It is often called NAND, which means "not and." This rule is different from saying two things are both true. Instead, it says that it is not the case that both things are true.
If you have two ideas, the Sheffer stroke is true if at least one idea is false. It only becomes false if both ideas are true. This simple rule helps us understand how different pieces of information fit together.
This tool is very special because it is functionally complete. This is a big term for a simple idea. It means you can build any other logic rule using only this one. You can use it to make "and," "or," and "not" rules.
Because it can do so much, it is vital for modern technology. Engineers use it to design computer processors. In the world of electronics, we call this a NAND gate. It is a tiny but mighty part of how digital machines think.
Many smart people worked on these ideas over a long time. Charles Sanders Peirce found this secret back in 1880. He called it "ampheck," which means cutting both ways. However, he did not publish his results for others to see. In 1911, a thinker named Łukasiewicz published a proof about these rules. He used a symbol called the Stamm hook. He showed how these rules could form a whole system.
Henry Maurice Sheffer is the man who gave the tool its name. In 1913, he wrote a paper about Boolean algebras. He showed how his rule could work with other math ideas. He used it to create a new way to organize logic. A man named Jean Nicod started using the stroke symbol in 1917. Later, famous thinkers like Whitehead and Russell used it too. They even suggested it as a replacement for other common rules in their books.
You can see this logic working in your own life. Think about a rule that says "you cannot have both cake and ice cream." This is like the Sheffer stroke. If you have only cake, the rule is followed. If you have only ice cream, the rule is also followed. If you have nothing, the rule is still followed. But if you try to take both, the rule is broken.
This is how computers use simple gates to make big decisions.
The Sheffer stroke is a fundamental logical operation used in Boolean functions and propositional calculus. It is most commonly known by its technical name, NAND, which stands for "not and." This operation acts on two logical values to produce a specific result. In everyday language, the Sheffer stroke can be described as "not both." This means the operation is true if it is not the case that both inputs are true.
This single tool is a cornerstone of mathematical logic and digital electronics. It allows mathematicians to build complex systems from very simple starting points.
To understand how the Sheffer stroke works, we must look at its truth conditions. The operation takes two propositions, often called operands, and evaluates them. The result is true if at least one of the operands is false. The only situation where the Sheffer stroke produces a false result is when both inputs are true.
This behavior is the exact opposite of the conjunction operation, which is commonly called "AND." Because it is the negation of conjunction, it is also referred to as non-conjunction or alternative denial. In digital electronics, this logic is physically realized as a NAND gate.
One of the most remarkable properties of the Sheffer stroke is its functional completeness. A set of logical operators is functionally complete if it can express any possible Boolean function. The Sheffer stroke is unique because it can do this entirely by itself. It does not require any other operators like "OR" or "NOT" to build a complete system.
This is possible because the Sheffer stroke lacks five specific properties: truth-preservation, falsity-preservation, linearity, monotonicity, and self-duality. By avoiding these properties, the NAND operation remains versatile enough to construct all other logic gates. For example, one can define the "NOT" operation by applying the Sheffer stroke to the same input twice.
History shows that many thinkers contributed to our understanding of this concept. Charles Sanders Peirce discovered the functional completeness of the NAND and NOR operations as early as 1880. He called this concept "ampheck," meaning "cutting both ways," but he never published his findings. In 1911, Łukasiewicz published the first proof of completeness for non-conjunction. He used a notation known as the Stamm hook. Later, in 1913, Henry Maurice Sheffer published a paper in the Transactions of the American Mathematical Society. He provided an axiomatization of Boolean algebras using this stroke and proved it was equivalent to the systems used by Edward Huntington.
While Sheffer provided the mathematical framework, the naming of the symbol evolved over time. In his 1913 paper, Sheffer actually interpreted the stroke as a sign for non-disjunction, also known as NOR. It was Jean Nicod who, in 1917, began using the stroke symbol specifically for non-conjunction, or NAND. This practice eventually became the standard. Famous logicians such as Bertrand Russell and Alfred North Whitehead adopted the Sheffer stroke in the 1927 second edition of their work, Principia Mathematica. They even proposed it as a way to replace the standard "OR" and "NOT" operations.
There are several ways to represent this operation through different notations. In Polish notation, developed by Łukasiewicz, it is written as a specific symbol. Other mathematicians have used different marks, such as the Peirce arrow or the Quine dagger, to represent its dual, the NOR operator.
The Sheffer stroke is commutative, meaning the order of the two inputs does not change the result. However, it is not associative, which means the grouping of operations matters when applying it to more than two values. This distinction is important when building long chains of logic in complex circuits.
Today, the significance of the Sheffer stroke extends far beyond theoretical mathematics. It is a crucial component in the design of computer processors and digital electronics. Because a single NAND gate can replicate any other logic gate, engineers can use it to create highly efficient hardware. This efficiency is vital for the complex circuitry found in modern computing devices. By understanding the simple rule of "not both," we gain insight into the very architecture of the digital age.
Where will your curiosity go next?
🖼️ Images & Media (10)
More to explore
✨ What else?
Related topics you might enjoy
🔬 Go deeper
More advanced topics to explore
What is Nepedia?
A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.