Charles Sanders Peirce 2026-10-24
An American philosopher associated here with Peirce's law.
Figure 1.
Portrait of Charles Sanders Peirce in 1859
. Unknown photographer. Tuttle Collection, Institute for Studies in Pragmaticism, Texas Tech University. The linked Commons record identifies the subject and marks the image as public domain in the United States; it supplies further usage information. Source.
This instance of Peirce's law uses the supplied classical double-negation elimination rule. First derive while assuming , using explosion inside a further temporary assumption.
1. (P → Q) → P          premise
2.   ¬P                 assumption [i]
3.     P                assumption [j]
4.     ⊥                ¬E, 2, 3
5.     Q                ⊥E, 4
6.   P → Q              →I, 3–5, discharging [j]
7.   P                  →E, 1, 6
8.   ⊥                  ¬E, 2, 7
9. ¬¬P                  ¬I, 2–8, discharging [i]
10. P                   ¬¬E, 9
This is a formal natural deduction proof from exactly the given premise; no unproved excluded-middle lemma is needed.
Write for . The following derives Peirce's law directly from the printed primitive rules, including double-negation elimination:
LineFormulaJustification
1Assume for the final implication
2Assume locally
3Assume inside the scope of 2
4Negation elimination rule, 2 and 3
5Logical falsity elimination rule, 4
6Implication introduction rule, discharging 3–5
7Implication elimination rule, 1 and 6
8Negation elimination rule, 2 and 7
9Negation introduction rule, discharging 2–8
10Double-negation elimination, 9
11Implication introduction rule, discharging 1–10
Every assumption is discharged, so the last formula is a theorem. In particular, no unproved appeal to the derived RAA rule is hidden in the argument.