Sheffer stroke
Sheffer stroke, also known as the nand operation, is a logical operation on two logical values, typically the values of two propositions, that produces a value of false only if both of its operands are true. In other words, it acts as the negation of the AND operation. The operation is named after Henry M. Sheffer, who in 1913 identified that all logical operations could be expressed in terms of a single, fundamental operation such as the nand operation. This discovery has significant implications in the fields of logic, mathematics, and computer science, particularly in the design and operation of digital circuits.
Definition[edit | edit source]
The Sheffer stroke is denoted by the symbol '|', and its operation can be defined by the truth table:
| p | q | q |
|---|---|---|
| T | T | F |
| T | Q | T |
| Q | T | T |
| Q | Q | T |
Where T stands for true and F for false. The result of p | q is true except when both p and q are true.
Properties[edit | edit source]
The Sheffer stroke possesses several important properties that make it a fundamental operation in logic:
- Functionally complete: Any logical operation can be constructed using only the Sheffer stroke. This means that logical expressions and functions can be simplified to expressions involving only nand operations.
- Self-dual: The Sheffer stroke operation is self-dual, meaning that swapping all Ts for Fs and all Fs for Ts in its truth table, and then swapping the operands, results in the same operation.
- Associative: The operation is associative, a property that allows the grouping of operands without affecting the result.
Applications[edit | edit source]
The Sheffer stroke's property of functional completeness makes it invaluable in the design of digital circuits and computational logic. It is used in the construction of logic gates and the simplification of logical expressions, which are fundamental in the development of digital computers and other digital systems.
See also[edit | edit source]
- Logical conjunction
- Logical disjunction
- Logical negation
- Boolean algebra (logic)
- Functional completeness
 | This logic-related article is a stub. You can help WikiMD by expanding it. |
Search WikiMD
Ad.Tired of being Overweight? Try W8MD's physician weight loss program.
Semaglutide (Ozempic / Wegovy and Tirzepatide (Mounjaro / Zepbound) available.
Advertise on WikiMD
|
WikiMD's Wellness Encyclopedia |
| Let Food Be Thy Medicine Medicine Thy Food - Hippocrates |
Translate this page: - East Asian
中文,
日本,
한국어,
South Asian
हिन्दी,
தமிழ்,
తెలుగు,
Urdu,
ಕನ್ನಡ,
Southeast Asian
Indonesian,
Vietnamese,
Thai,
မြန်မာဘာသာ,
বাংলা
European
español,
Deutsch,
français,
Greek,
português do Brasil,
polski,
română,
русский,
Nederlands,
norsk,
svenska,
suomi,
Italian
Middle Eastern & African
عربى,
Turkish,
Persian,
Hebrew,
Afrikaans,
isiZulu,
Kiswahili,
Other
Bulgarian,
Hungarian,
Czech,
Swedish,
മലയാളം,
मराठी,
ਪੰਜਾਬੀ,
ગુજરાતી,
Portuguese,
Ukrainian
Medical Disclaimer: WikiMD is not a substitute for professional medical advice. The information on WikiMD is provided as an information resource only, may be incorrect, outdated or misleading, and is not to be used or relied on for any diagnostic or treatment purposes. Please consult your health care provider before making any healthcare decisions or for guidance about a specific medical condition. WikiMD expressly disclaims responsibility, and shall have no liability, for any damages, loss, injury, or liability whatsoever suffered as a result of your reliance on the information contained in this site. By visiting this site you agree to the foregoing terms and conditions, which may from time to time be changed or supplemented by WikiMD. If you do not agree to the foregoing terms and conditions, you should not enter or use this site. See full disclaimer.
Credits:Most images are courtesy of Wikimedia commons, and templates Wikipedia, licensed under CC BY SA or similar.
Contributors: Prab R. Tumpati, MD
