You are here
Home ›Peirce's law
Primary tabs
Peirce’s law
Peirce’s law is a formula in propositional calculus that is commonly expressed in the following form:
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.
Contents:
- 1 History
- 2 Graphical proof
- 3 Equational form
- 3.1 Proof 1
- 3.2 Proof 2
- 4 Bibliography
1 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:
This is hardly axiomatical. That it is true appears as follows. It can only be false by the final consequent being false while its antecedent is true. If this is true, either its consequent, , is true, when the whole formula would be true, or its antecedent is false. But in the last case the antecedent of , that is , 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:
where the is used in such a sense that means that from every proposition follows. With that understanding, the formula states the principle of excluded middle, that from the falsity of the denial of follows the truth of . (Peirce, CP 3.384).
Note. Peirce uses the “sign of illation” () for implication. In one place he explains it as a variant of the sign () for “less than or equal to”; in another place he suggests reading as “, in every way that it can be, is ”.
2 Graphical proof
Representing propositions as logical graphs under the existential interpretation, Peirce’s law is expressed by means of the following formal 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) |
3 Equational form
A stronger form of Peirce’s law also holds, in which the final implication is observed to be reversible:
3.1 Proof 1
Given what precedes, it remains to show that:
But this is immediate, since for any proposition
3.2 Proof 2
Representing propositions as logical graphs under the existential interpretation, the strong form of Peirce’s law is expressed by the following equation:
| (3) |
Using the axioms and theorems listed in the entries on logical graphs, the equational form of Peirce’s law may be proved in the following manner:
| (4) |
4 Bibliography
-
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).
Mathematics Subject Classification
03B70 Logic in computer science03B35 Mechanization of proofs and logical operations
03B22 Abstract deductive systems
03B05 Classical propositional logic
03-03 Historical concerning 03-XX
01A55 19th century
- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)
- Other useful stuff
Recent Activity
new question: pure subgroups by lvoyster
new correction: Typo in M\"obius function? by Aleph Zero
new collection: analytic number theory by Aleph Zero
May 20
new question: Taylor's Series Query! by unlord
new question: Laplace transform by J
new question: Residue Calculus by J
May 19
new Education: Project: PlanetMath Outlines Series by unlord
May 17
new image: sinx_approx.png by jeremyboden
new image: approximation_to_sinx by jeremyboden
new image: approximation_to_sinx by jeremyboden


