Difference between revisions of "Ampheck"
Jon Awbrey (talk  contribs) (add article (math test)) 
(No difference)

Latest revision as of 11:14, 19 April 2017
☞ This page belongs to resource collections on Logic and Inquiry.
Ampheck, from Greek αμφήκης doubleedged, 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 NAND and 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 functions, monadic predicate calculus, propositional calculus, sentential calculus, or zeroth order logic.
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).
In the above passage, Peirce introduces the term ampheck for the 2place 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 "neithernor" 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 "notand" 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.
Contents
References and further reading
 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.
 Houser, N., Roberts, Don D., and Van Evra, James (eds., 1997), Studies in the Logic of Charles Sanders Peirce, Indiana University Press, Bloomington, IN.
 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. Online.
 McCulloch, W.S. (1965), Embodiments of Mind, MIT Press, Cambridge, MA.
 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.
 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
Peer nodes
 Ampheck @ InterSciWiki
 Ampheck @ MyWikiBiz
 Ampheck @ Subject Wikis
 Ampheck @ Wikiversity
 Ampheck @ Wikiversity Beta
Logical operators
Template:Colbegin Template:Colbreak
Related topics
Template:Colbegin Template:Colbreak
 Propositional calculus
 Sole sufficient operator
 Truth table
 Universe of discourse
 Zeroth order logic
Relational concepts
Template:Colbegin Template:Colbreak
Information, Inquiry
Template:Colbegin Template:Colbreak
Related articles
Template:Colbegin Template:Colbreak
 Differential Logic : Introduction
 Differential Propositional Calculus
 Differential Logic and Dynamic Systems
 Prospects for Inquiry Driven Systems
 Introduction to Inquiry Driven Systems
 Inquiry Driven Systems : Inquiry Into Inquiry
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.