12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Tuesday November 26, 2024
Jump to navigationJump to searchcopy text from [http://www.opencycle.net/ OpenCycle] of which Jon Awbrey is the sole author
'''Ampheck''', from [[Ancient Greek|Greek]] αμφήκης double-edged, is a term coined by [[Charles Sanders Peirce]] for either one of the pair of logically dual operators, variously referred to as [[Peirce arrow]]s, [[Sheffer stroke]]s, or [[logical NAND|NAND]] and [[logical NNOR|NNOR]]. Either of these logical operators is a [[sole sufficient operator]] for deriving or generating all of the other operators in what is variously called the subject matter of [[boolean function]]s, [[propositional logic]], sentential calculus, or [[zeroth-order logic]].
<blockquote>
<p>For example, <math>x \perp y</math> signifies that <math>x\!</math> is <math>\mathbf{f}</math> and <math>y\!</math> is <math>\mathbf{f}</math>. Then <math>(x \perp y) \perp z</math>, or <math>\underline {x \perp y} \perp z</math>, will signify that <math>z\!</math> is <math>\mathbf{f}</math>, but that the statement that <math>x\!</math> and <math>y\!</math> are both <math>\mathbf{f}</math> is itself <math>\mathbf{f}</math>, that is, is ''false''. Hence, the value of <math>x \perp x</math> is the same as that of <math>\overline {x}</math>; and the value of <math>\underline {x \perp x} \perp x</math> is <math>\mathbf{f}</math>, because it is necessarily false; while the value of <math>\underline {x \perp y} \perp \underline {x \perp y}</math> is only <math>\mathbf{f}</math> in case <math>x \perp y</math> is <math>\mathbf{v}</math>; and <math>( \underline {x \perp x} \perp x) \perp (x \perp \underline {x \perp x})</math> is necessarily true, so that its value is <math>\mathbf{v}</math>.</p>
<p>With these two signs, the [[vinculum]] (with its equivalents, parentheses, brackets, braces, etc.) and the sign <math>\perp</math>, which I will call the ''ampheck'' (from αμφηκής , cutting both ways), all assertions as to the values of quantities can be expressed. (C.S. Peirce, CP 4.264).</p>
</blockquote>
In the above passage, Peirce introduces the term ''ampheck'' for the 2-place logical connective or the binary logical operator that is currently called the ''[[joint denial]]'' in logic, the NNOR operator in computer science, or indicated by means of phrases like "neither-nor" or "both not" in ordinary language. For this operation he employs a symbol that the typographer most likely set by inverting the [[zodiac]] symbol for [[Aries]], but set in the text above by commandeering the symbol for the ''[[bottom element]]'' of a [[lattice (order)|lattice]] or [[partially ordered set]].
In the same paper, Peirce introduces a symbol for the logically dual operator. This was rendered by the editors of his ''Collected Papers'' as an inverted Aries symbol with a bar or a serif at the top, in this way denoting the connective or logical operator that is currently called the ''[[alternative denial]]'' in logic, the NAND operator in computer science, or invoked by means of phrases like "not-and" or "not both" in ordinary language. It is not clear whether it was Peirce himself or later writers who initiated the practice, but on account of their dual relationship it became common to refer to these two operators in the plural, as the ''amphecks''.
==References and further reading==
* [[Glenn Clark|Clark, Glenn]] (1997), "New Light on Peirce's Iconic Notation for the Sixteen Binary Connectives", pp. 304–333 in Houser, Roberts, Van Evra (eds.), ''Studies in the Logic of Charles Sanders Peirce'', Indiana University Press, Bloomington, IN, 1997.
* [[Nathan Houser|Houser, N.]], [[Don D. Roberts|Roberts, Don D.]], and [[James Van Evra|Van Evra, James]] (eds., 1997), ''Studies in the Logic of Charles Sanders Peirce'', Indiana University Press, Bloomington, IN.
* [[Warren Sturgis McCulloch|McCulloch, W.S.]] (1961), "What Is a Number, that a Man May Know It, and a Man, that He May Know a Number?" (Ninth [[Alfred Korzybski]] Memorial Lecture), ''General Semantics Bulletin'', Nos. 26 & 27, 7–18, Institute of General Semantics, Lakeville, CT, 1961. Reprinted, pp. 1–18 in ''Embodiments of Mind''.
* McCulloch, W.S. (1965), ''Embodiments of Mind'', MIT Press, Cambridge, MA.
* [[Charles Sanders Peirce (Bibliography)|Peirce, C.S., Bibliography]].
* Peirce, C.S., ''Collected Papers of Charles Sanders Peirce'', vols. 1–6, [[Charles Hartshorne]] and [[Paul Weiss]] (eds.), vols. 7–8, [[Arthur W. Burks]] (ed.), Harvard University Press, Cambridge, MA, 1931–1935, 1958.
* Peirce, C.S. (1902), "The Simplest Mathematics". First published as CP 4.227–323 in ''Collected Papers''.
* [[Shea Zellweger|Zellweger, Shea]] (1997), "Untapped Potential in Peirce's Iconic Notation for the Sixteen Binary Connectives", pp. 334–386 in Houser, Roberts, Van Evra (eds.), ''Studies in the Logic of Charles Sanders Peirce'', Indiana University Press, Bloomington, IN, 1997.
==See also==
* [[Laws of Form]]
* [[Logical graph]]
* [[Logical NAND]] (Sheffer stroke)
* [[Logical NNOR]] (Peirce arrow)
* [[Minimal negation operator]]
* [[Sole sufficient operator]]
<blockquote>
<p>For example, <math>x \perp y</math> signifies that <math>x\!</math> is <math>\mathbf{f}</math> and <math>y\!</math> is <math>\mathbf{f}</math>. Then <math>(x \perp y) \perp z</math>, or <math>\underline {x \perp y} \perp z</math>, will signify that <math>z\!</math> is <math>\mathbf{f}</math>, but that the statement that <math>x\!</math> and <math>y\!</math> are both <math>\mathbf{f}</math> is itself <math>\mathbf{f}</math>, that is, is ''false''. Hence, the value of <math>x \perp x</math> is the same as that of <math>\overline {x}</math>; and the value of <math>\underline {x \perp x} \perp x</math> is <math>\mathbf{f}</math>, because it is necessarily false; while the value of <math>\underline {x \perp y} \perp \underline {x \perp y}</math> is only <math>\mathbf{f}</math> in case <math>x \perp y</math> is <math>\mathbf{v}</math>; and <math>( \underline {x \perp x} \perp x) \perp (x \perp \underline {x \perp x})</math> is necessarily true, so that its value is <math>\mathbf{v}</math>.</p>
<p>With these two signs, the [[vinculum]] (with its equivalents, parentheses, brackets, braces, etc.) and the sign <math>\perp</math>, which I will call the ''ampheck'' (from αμφηκής , cutting both ways), all assertions as to the values of quantities can be expressed. (C.S. Peirce, CP 4.264).</p>
</blockquote>
In the above passage, Peirce introduces the term ''ampheck'' for the 2-place logical connective or the binary logical operator that is currently called the ''[[joint denial]]'' in logic, the NNOR operator in computer science, or indicated by means of phrases like "neither-nor" or "both not" in ordinary language. For this operation he employs a symbol that the typographer most likely set by inverting the [[zodiac]] symbol for [[Aries]], but set in the text above by commandeering the symbol for the ''[[bottom element]]'' of a [[lattice (order)|lattice]] or [[partially ordered set]].
In the same paper, Peirce introduces a symbol for the logically dual operator. This was rendered by the editors of his ''Collected Papers'' as an inverted Aries symbol with a bar or a serif at the top, in this way denoting the connective or logical operator that is currently called the ''[[alternative denial]]'' in logic, the NAND operator in computer science, or invoked by means of phrases like "not-and" or "not both" in ordinary language. It is not clear whether it was Peirce himself or later writers who initiated the practice, but on account of their dual relationship it became common to refer to these two operators in the plural, as the ''amphecks''.
==References and further reading==
* [[Glenn Clark|Clark, Glenn]] (1997), "New Light on Peirce's Iconic Notation for the Sixteen Binary Connectives", pp. 304–333 in Houser, Roberts, Van Evra (eds.), ''Studies in the Logic of Charles Sanders Peirce'', Indiana University Press, Bloomington, IN, 1997.
* [[Nathan Houser|Houser, N.]], [[Don D. Roberts|Roberts, Don D.]], and [[James Van Evra|Van Evra, James]] (eds., 1997), ''Studies in the Logic of Charles Sanders Peirce'', Indiana University Press, Bloomington, IN.
* [[Warren Sturgis McCulloch|McCulloch, W.S.]] (1961), "What Is a Number, that a Man May Know It, and a Man, that He May Know a Number?" (Ninth [[Alfred Korzybski]] Memorial Lecture), ''General Semantics Bulletin'', Nos. 26 & 27, 7–18, Institute of General Semantics, Lakeville, CT, 1961. Reprinted, pp. 1–18 in ''Embodiments of Mind''.
* McCulloch, W.S. (1965), ''Embodiments of Mind'', MIT Press, Cambridge, MA.
* [[Charles Sanders Peirce (Bibliography)|Peirce, C.S., Bibliography]].
* Peirce, C.S., ''Collected Papers of Charles Sanders Peirce'', vols. 1–6, [[Charles Hartshorne]] and [[Paul Weiss]] (eds.), vols. 7–8, [[Arthur W. Burks]] (ed.), Harvard University Press, Cambridge, MA, 1931–1935, 1958.
* Peirce, C.S. (1902), "The Simplest Mathematics". First published as CP 4.227–323 in ''Collected Papers''.
* [[Shea Zellweger|Zellweger, Shea]] (1997), "Untapped Potential in Peirce's Iconic Notation for the Sixteen Binary Connectives", pp. 334–386 in Houser, Roberts, Van Evra (eds.), ''Studies in the Logic of Charles Sanders Peirce'', Indiana University Press, Bloomington, IN, 1997.
==See also==
* [[Laws of Form]]
* [[Logical graph]]
* [[Logical NAND]] (Sheffer stroke)
* [[Logical NNOR]] (Peirce arrow)
* [[Minimal negation operator]]
* [[Sole sufficient operator]]
