Jon Awbrey: update

2015-11-05T15:05:35Z

update

← Older revision		Revision as of 15:05, 5 November 2015
Line 145:		Line 145:
	* [http://mywikibiz.com/Ampheck Ampheck], [http://mywikibiz.com/ MyWikiBiz]		* [http://mywikibiz.com/Ampheck Ampheck], [http://mywikibiz.com/ MyWikiBiz]
	* [http://planetmath.org/Ampheck Ampheck], [http://planetmath.org/ PlanetMath]		* [http://planetmath.org/Ampheck Ampheck], [http://planetmath.org/ PlanetMath]
			* [http://wikinfo.org/w/index.php/Ampheck Ampheck], [http://wikinfo.org/w/ Wikinfo]
	* [http://en.wikiversity.org/wiki/Ampheck Ampheck], [http://en.wikiversity.org/ Wikiversity]		* [http://en.wikiversity.org/wiki/Ampheck Ampheck], [http://en.wikiversity.org/ Wikiversity]
	* [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]

Jon Awbrey: update

2015-10-31T03:04:03Z

update

Show changes

Jon Awbrey: + article

2010-06-20T23:08:15Z

+ article

New page

☞ 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]].

<blockquote>
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>.

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).
</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 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.

==Syllabus==

===Focal nodes===

{{col-begin}}
{{col-break}}
* [[Inquiry Live]]
{{col-break}}
* [[Logic Live]]
{{col-end}}

===Peer nodes===

{{col-begin}}
{{col-break}}
* [http://mywikibiz.com/Ampheck Ampheck @ MyWikiBiz]
* [http://mathweb.org/wiki/Ampheck Ampheck @ MathWeb Wiki]
* [http://netknowledge.org/wiki/Ampheck Ampheck @ NetKnowledge]
* [http://wiki.oercommons.org/mediawiki/index.php/Ampheck Ampheck @ OER Commons]
{{col-break}}
* [http://p2pfoundation.net/Ampheck Ampheck @ P2P Foundation]
* [http://semanticweb.org/wiki/Ampheck Ampheck @ SemanticWeb]
* [http://ref.subwiki.org/wiki/Ampheck Ampheck @ Subject Wikis]
* [http://beta.wikiversity.org/wiki/Ampheck Ampheck @ Wikiversity Beta]
{{col-end}}

===Logical operators===

{{col-begin}}
{{col-break}}
* [[Exclusive disjunction]]
* [[Logical conjunction]]
* [[Logical disjunction]]
* [[Logical equality]]
{{col-break}}
* [[Logical implication]]
* [[Logical NAND]]
* [[Logical NNOR]]
* [[Logical negation|Negation]]
{{col-end}}

===Related topics===

{{col-begin}}
{{col-break}}
* [[Ampheck]]
* [[Boolean domain]]
* [[Boolean function]]
* [[Boolean-valued function]]
* [[Differential logic]]
{{col-break}}
* [[Logical graph]]
* [[Minimal negation operator]]
* [[Multigrade operator]]
* [[Parametric operator]]
* [[Peirce's law]]
{{col-break}}
* [[Propositional calculus]]
* [[Sole sufficient operator]]
* [[Truth table]]
* [[Universe of discourse]]
* [[Zeroth order logic]]
{{col-end}}

===Relational concepts===

{{col-begin}}
{{col-break}}
* [[Continuous predicate]]
* [[Hypostatic abstraction]]
* [[Logic of relatives]]
* [[Logical matrix]]
{{col-break}}
* [[Relation (mathematics)|Relation]]
* [[Relation composition]]
* [[Relation construction]]
* [[Relation reduction]]
{{col-break}}
* [[Relation theory]]
* [[Relative term]]
* [[Sign relation]]
* [[Triadic relation]]
{{col-end}}

===Information, Inquiry===

{{col-begin}}
{{col-break}}
* [[Inquiry]]
* [[Dynamics of inquiry]]
{{col-break}}
* [[Semeiotic]]
* [[Logic of information]]
{{col-break}}
* [[Descriptive science]]
* [[Normative science]]
{{col-break}}
* [[Pragmatic maxim]]
* [[Truth theory]]
{{col-end}}

===Related articles===

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Semiotic_Information Jon Awbrey, “Semiotic Information”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Introduction_to_Inquiry_Driven_Systems Jon Awbrey, “Introduction To Inquiry Driven Systems”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Essays/Prospects_For_Inquiry_Driven_Systems Jon Awbrey, “Prospects For Inquiry Driven Systems”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Inquiry_Driven_Systems Jon Awbrey, “Inquiry Driven Systems : Inquiry Into Inquiry”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Propositional_Equation_Reasoning_Systems Jon Awbrey, “Propositional Equation Reasoning Systems”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Differential_Logic_:_Introduction Jon Awbrey, “Differential Logic : Introduction”]

* [http://planetmath.org/encyclopedia/DifferentialPropositionalCalculus.html Jon Awbrey, “Differential Propositional Calculus”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Differential_Logic_and_Dynamic_Systems_2.0 Jon Awbrey, “Differential Logic and Dynamic Systems”]

==Document history==

Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders.

{{col-begin}}
{{col-break}}
* [http://mywikibiz.com/Ampheck Ampheck], [http://mywikibiz.com/ MyWikiBiz]
* [http://mathweb.org/wiki/Ampheck Ampheck], [http://mathweb.org/wiki/ MathWeb Wiki]
* [http://netknowledge.org/wiki/Ampheck Ampheck], [http://netknowledge.org/ NetKnowledge]
* [http://wiki.oercommons.org/mediawiki/index.php/Ampheck Ampheck], [http://wiki.oercommons.org/ OER Commons]
{{col-break}}
* [http://p2pfoundation.net/Ampheck Ampheck], [http://p2pfoundation.net/ P2P Foundation]
* [http://semanticweb.org/wiki/Ampheck Ampheck], [http://semanticweb.org/ SemanticWeb]
* [http://planetmath.org/encyclopedia/Ampheck.html Ampheck], [http://planetmath.org/ PlanetMath]
* [http://beta.wikiversity.org/wiki/Ampheck Ampheck], [http://beta.wikiversity.org/ Wikiversity Beta]
{{col-break}}
* [http://getwiki.net/-Ampheck Ampheck], [http://getwiki.net/ GetWiki]
* [http://wikinfo.org/index.php/Ampheck Ampheck], [http://wikinfo.org/ Wikinfo]
* [http://textop.org/wiki/index.php?title=Ampheck Ampheck], [http://textop.org/wiki/ Textop Wiki]
* [http://en.wikipedia.org/w/index.php?title=Ampheck&oldid=62218032 Ampheck], [http://en.wikipedia.org/ Wikipedia]
{{col-end}}

[[Category:Inquiry]]
[[Category:Open Educational Resource]]
[[Category:Peer Educational Resource]]
[[Category:Automata Theory]]
[[Category:Combinatorics]]
[[Category:Computer Science]]
[[Category:Discrete Mathematics]]
[[Category:Logic]]
[[Category:Mathematics]]
[[Category:Neural Networks]]
[[Category:Semiotics]]

Ampheck - Revision history

Jon Awbrey: update

Jon Awbrey: update

Jon Awbrey: + article