12,080
edits
Changes
update
<font size="3">☞</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]].
<font size="3">☞</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]].
'''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 the subject matter variously described as [[boolean function]]s, [[monadic predicate calculus]], [[propositional logic]], sentential calculus, or [[zeroth order logic]].
'''Ampheck''', from 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 arrows, Sheffer strokes, 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 the subject matter variously described as [[boolean function]]s, monadic predicate calculus, [[propositional calculus]], sentential calculus, or [[zeroth order logic]].
<blockquote>
<blockquote>
<p>For example, <math>x \curlywedge y</math> signifies that <math>x\!</math> is <math>\mathbf{f}</math> and <math>y\!</math> is <math>\mathbf{f}</math>. Then <math>(x \curlywedge y) \curlywedge z</math>, or <math>\underline {x \curlywedge y} \curlywedge 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 \curlywedge x</math> is the same as that of <math>\overline {x}</math>; and the value of <math>\underline {x \curlywedge x} \curlywedge x</math> is <math>\mathbf{f}</math>, because it is necessarily false; while the value of <math>\underline {x \curlywedge y} \curlywedge \underline {x \curlywedge y}</math> is only <math>\mathbf{f}</math> in case <math>x \curlywedge y</math> is <math>\mathbf{v}</math>; and <math>( \underline {x \curlywedge x} \curlywedge x) \curlywedge (x \curlywedge \underline {x \curlywedge x})</math> is necessarily true, so that its value is <math>\mathbf{v}</math>.</p>
<p>For example, <math>x \curlywedge y</math> signifies that <math>x\!</math> is <math>\mathbf{f}</math> and <math>y\!</math> is <math>\mathbf{f}</math>. Then <math>(x \curlywedge y) \curlywedge z</math>, or <math>\underline {x \curlywedge y} \curlywedge 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 \curlywedge x</math> is the same as that of <math>\overline {x}</math>; and the value of <math>\underline {x \curlywedge x} \curlywedge x</math> is <math>\mathbf{f}</math>, because it is necessarily false; while the value of <math>\underline {x \curlywedge y} \curlywedge \underline {x \curlywedge y}</math> is only <math>\mathbf{f}</math> in case <math>x \curlywedge y</math> is <math>\mathbf{v}</math>; and <math>( \underline {x \curlywedge x} \curlywedge x) \curlywedge (x \curlywedge \underline {x \curlywedge 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>\curlywedge</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>
<p>With these two signs, the vinculum (with its equivalents, parentheses, brackets, braces, etc.) and the sign <math>\curlywedge</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>
</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 means of the ''curly wedge'' symbol.
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 means of the ''curly wedge'' symbol.
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''.
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==
==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.
* 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.
* Houser, N., Roberts, Don D., and 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. (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. Reprinted, pp. 1–18 in ''Embodiments of Mind''. [http://www.vordenker.de/ggphilosophy/mcculloch_what-is-a-number.pdf Online].
* McCulloch, W.S. (1965), ''Embodiments of Mind'', MIT Press, Cambridge, MA.
* McCulloch, W.S. (1965), ''Embodiments of Mind'', MIT Press, Cambridge, MA.
* [[Charles Sanders Peirce (Bibliography)|Peirce, C.S., Bibliography]].
* [[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., ''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''.
* 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.
* 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.
==Syllabus==
==Syllabus==
{{col-begin}}
{{col-begin}}
{{col-break}}
{{col-break}}
* [http://intersci.ss.uci.edu/wiki/index.php/Ampheck Ampheck @ InterSciWiki]
* [http://mywikibiz.com/Ampheck Ampheck @ MyWikiBiz]
* [http://mywikibiz.com/Ampheck Ampheck @ MyWikiBiz]
{{col-break}}
{{col-break}}
* [http://p2pfoundation.net/Ampheck Ampheck @ P2P Foundation]
* [http://beta.wikiversity.org/wiki/Ampheck Ampheck @ Wikiversity Beta]
* [http://ref.subwiki.org/wiki/Ampheck Ampheck @ Subject Wikis]
* [http://ref.subwiki.org/wiki/Ampheck Ampheck @ Subject Wikis]
{{col-end}}
{{col-end}}
===Related articles===
===Related articles===
* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Semiotic_Information Jon Awbrey, “Semiotic Information”]
{{col-begin}}
{{col-break}}
* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Introduction_to_Inquiry_Driven_Systems Jon Awbrey, “Introduction To Inquiry Driven Systems”]
* [http://intersci.ss.uci.edu/wiki/index.php/Cactus_Language Cactus Language]
* [http://intersci.ss.uci.edu/wiki/index.php/Futures_Of_Logical_Graphs Futures Of Logical Graphs]
* [http://mywikibiz.com/Directory:Jon_Awbrey/Essays/Prospects_For_Inquiry_Driven_Systems Jon Awbrey, “Prospects For Inquiry Driven Systems”]
* [http://intersci.ss.uci.edu/wiki/index.php/Propositional_Equation_Reasoning_Systems Propositional Equation Reasoning Systems]
{{col-break}}
* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Inquiry_Driven_Systems Jon Awbrey, “Inquiry Driven Systems : Inquiry Into Inquiry”]
* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_:_Introduction Differential Logic : Introduction]
* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Propositional_Calculus Differential Propositional Calculus]
* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Propositional_Equation_Reasoning_Systems Jon Awbrey, “Propositional Equation Reasoning Systems”]
* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_and_Dynamic_Systems_2.0 Differential Logic and Dynamic Systems]
{{col-break}}
* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Differential_Logic_:_Introduction Jon Awbrey, “Differential Logic : Introduction”]
* [http://intersci.ss.uci.edu/wiki/index.php/Introduction_to_Inquiry_Driven_Systems Introduction to Inquiry Driven Systems]
* [http://intersci.ss.uci.edu/wiki/index.php/Prospects_for_Inquiry_Driven_Systems Prospects for Inquiry Driven Systems]
* [http://planetmath.org/encyclopedia/DifferentialPropositionalCalculus.html Jon Awbrey, “Differential Propositional Calculus”]
* [http://intersci.ss.uci.edu/wiki/index.php/Inquiry_Driven_Systems Inquiry Driven Systems : Inquiry Into Inquiry]
{{col-end}}
* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Differential_Logic_and_Dynamic_Systems_2.0 Jon Awbrey, “Differential Logic and Dynamic Systems”]
==Document history==
==Document history==
* [http://mywikibiz.com/Ampheck Ampheck], [http://mywikibiz.com/ MyWikiBiz]
* [http://mywikibiz.com/Ampheck Ampheck], [http://mywikibiz.com/ MyWikiBiz]
* [http://mathweb.org/wiki/Ampheck Ampheck], [http://mathweb.org/wiki/ MathWeb Wiki]
* [http://mathweb.org/wiki/Ampheck Ampheck], [http://mathweb.org/wiki/ MathWeb Wiki]
{{col-break}}
{{col-break}}
* [http://planetmath.org/Ampheck Ampheck], [http://planetmath.org/ PlanetMath]
* [http://planetmath.org/encyclopedia/Ampheck.html Ampheck], [http://planetmath.org/ PlanetMath]
* [http://beta.wikiversity.org/wiki/Ampheck Ampheck], [http://beta.wikiversity.org/ Wikiversity Beta]
* [http://beta.wikiversity.org/wiki/Ampheck Ampheck], [http://beta.wikiversity.org/ Wikiversity Beta]
{{col-break}}
{{col-break}}
* [http://getwiki.net/-Ampheck Ampheck], [http://getwiki.net/ GetWiki]
* [http://getwiki.net/-Ampheck Ampheck], [http://getwiki.net/ GetWiki]
* [http://en.wikipedia.org/w/index.php?title=Ampheck&oldid=62218032 Ampheck], [http://en.wikipedia.org/ Wikipedia]
* [http://en.wikipedia.org/w/index.php?title=Ampheck&oldid=62218032 Ampheck], [http://en.wikipedia.org/ Wikipedia]
{{col-end}}
{{col-end}}
[[Category:Inquiry]]
[[Category:Inquiry]]