Difference between revisions of "Peirce's law"
Jon Awbrey (talk | contribs) (→Bibliography: format) |
Jon Awbrey (talk | contribs) |
||
| Line 322: | Line 322: | ||
[[Category:Peer Educational Resource]] | [[Category:Peer Educational Resource]] | ||
[[Category:Artificial Intelligence]] | [[Category:Artificial Intelligence]] | ||
| + | [[Category:Charles Sanders Peirce]] | ||
[[Category:Combinatorics]] | [[Category:Combinatorics]] | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
Revision as of 18:46, 29 October 2011
☞ This page belongs to resource collections on Logic and Inquiry.
Peirce's law is a formula in propositional calculus that is commonly expressed in the following form:
| \(((p \Rightarrow q) \Rightarrow p) \Rightarrow p\) |
Peirce's law holds in classical propositional calculus, but not in intuitionistic propositional calculus. The precise axiom system that one chooses for classical propositional calculus determines whether Peirce's law is taken as an axiom or proven as a theorem.
History
Here is Peirce's own statement and proof of the law:
|
A fifth icon is required for the principle of excluded middle and other propositions connected with it. One of the simplest formulae of this kind is: \(\{ (x \,-\!\!\!< y) \,-\!\!\!< x \} \,-\!\!\!< x.\) This is hardly axiomatical. That it is true appears as follows. It can only be false by the final consequent \(x\!\) being false while its antecedent \((x \,-\!\!\!< y) \,-\!\!\!< x\) is true. If this is true, either its consequent, \(x,\!\) is true, when the whole formula would be true, or its antecedent \(x \,-\!\!\!< y\) is false. But in the last case the antecedent of \(x \,-\!\!\!< y,\) that is \(x,\!\) must be true. (Peirce, CP 3.384). |
Peirce goes on to point out an immediate application of the law:
|
From the formula just given, we at once get: \(\{ (x \,-\!\!\!< y) \,-\!\!\!< a \} \,-\!\!\!< x,\) where the \(a\!\) is used in such a sense that \((x \,-\!\!\!< y) \,-\!\!\!< a\) means that from \((x \,-\!\!\!< y)\) every proposition follows. With that understanding, the formula states the principle of excluded middle, that from the falsity of the denial of \(x\!\) follows the truth of \(x.\!\) (Peirce, CP 3.384). |
Note. Peirce uses the sign of illation “\(-\!\!\!<\)” for implication. In one place he explains “\(-\!\!\!<\)” as a variant of the sign “\(\le\)” for less than or equal to; in another place he suggests that \(A \,-\!\!\!< B\) is an iconic way of representing a state of affairs where \(A,\!\) in every way that it can be, is \(B.\!\)
Graphical proof
Under the existential interpretation of Peirce's logical graphs, Peirce's law is represented by means of the following formal equivalence or logical equation.
 |
(1) |
Proof. Using the axiom set given in the entry for logical graphs, Peirce's law may be proved in the following manner.
|
(2) |
).png){kind=small}
).png){kind=small}
The following animation replays the steps of the proof.
|
(3) |
Equational form
A stronger form of Peirce's law also holds, in which the final implication is observed to be reversible:
| \(((p \Rightarrow q) \Rightarrow p) \Leftrightarrow p\) |
Proof 1
Given what precedes, it remains to show that:
| \(p \Rightarrow ((p \Rightarrow q) \Rightarrow p)\) |
But this is immediate, since \(p \Rightarrow (r \Rightarrow p)\) for any proposition \(r.\!\)
Proof 2
Representing propositions as logical graphs under the existential interpretation, the strong form of Peirce's law is expressed by the following equation:
 |
(4) |
Using the axioms and theorems listed in the article on logical graphs, the equational form of Peirce's law may be proved in the following manner:
|
(5) |
).png){kind=small}
).png){kind=small}
The following animation replays the steps of the proof.
|
(6) |
Bibliography
- Peirce, Charles Sanders (1885), “On the Algebra of Logic : A Contribution to the Philosophy of Notation”, American Journal of Mathematics 7, pp. 180–202. Reprinted (CP 3.359–403), (CE 5, 162–190).
- Peirce, Charles Sanders (1931–1935, 1958), 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. Cited as (CP volume.paragraph).
- Peirce, Charles Sanders (1981–), Writings of Charles S. Peirce : A Chronological Edition, Peirce Edition Project (eds.), Indiana University Press, Bloomington and Indianapolis, IN. Cited as (CE volume, page).
- Awbrey, Jon L. (27 Jul 2009), “Peirce’s Law : A Curious Truth of Classical Logic”, Google Knol, Online.
External links
Syllabus
Focal nodes
Template:Col-breakTemplate:Col-breakTemplate:Col-endPeer nodes
- Peirce's Law @ MyWikiBiz
- Peirce's Law @ MathWeb Wiki
- Peirce's Law @ NetKnowledge
- Peirce's Law @ OER Commons
- Peirce's Law @ P2P Foundation
- Peirce's Law @ SemanticWeb
- Peirce's Law @ Subject Wikis
- Peirce's Law @ Wikiversity Beta
Logical operators
Related topics
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
Relational concepts
Information, Inquiry
Related articles
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.
- Peirce's Law, MyWikiBiz
- Peirce's Law, MathWeb Wiki
- Peirce's Law, NetKnowledge
- Peirce's Law, OER Commons
- Peirce's Law, PlanetMath
- Peirce's Law, ProofWiki
- Peirce's Law, Wikiversity Beta
- Peirce's Law, Google Knol
- Peirce's Law, GetWiki
- Peirce's Law, Wikinfo
- Peirce's Law, Textop Wiki
- Peirce's Law, Wikipedia
<sharethis />
- Inquiry
- Open Educational Resource
- Peer Educational Resource
- Artificial Intelligence
- Charles Sanders Peirce
- Combinatorics
- Computer Science
- Cybernetics
- Equational Reasoning
- Formal Languages
- Formal Systems
- Graph Theory
- History of Logic
- History of Mathematics
- Knowledge Representation
- Logic
- Logical Graphs
- Mathematics
- Philosophy
- Semiotics
- Visualization
