Peirce’s Law

A Curious Truth of Classical Logic

Peirce’s law is a logical proposition that states a non-obvious truth of classical logic and affords a novel way of defining classical propositional calculus.


Peirce’s law is a statement in propositional calculus that is commonly expressed in the following form:

((p ⇒ q) ⇒ p) ⇒ 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.


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 “≤” 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

Representing propositions in the language of logical graphs, and operating under the existential interpretation, Peirce’s law is expressed by means of the following formal equivalence or logical equation:



Proof.  Using the axiom set given in the articles on logical graphs, Peirce’s law may be proved in the following manner.



The following animation replays the steps of the proof.

Equational Form

A stronger form of Peirce’s law also holds, in which the final implication is observed to be reversible:

((p ⇒ q) ⇒ p) ⇔ p

Proof 1

Given what precedes, it remains to show that:

p ⇒ ((p ⇒ q) ⇒ p)

But this is immediate, since p ⇒ (r ⇒ 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:



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:



The following animation replays the steps of the proof.


  • Peirce, Charles Sanders (1885), “On the Algebra of Logic : A Contribution to the Philosophy of Notation”, American Journal of Mathematics 7 (1885), 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).


This entry was posted in Article, C.S. Peirce, Computation, Computer Science, Laws of Form, Logic, Logical Graphs, Mathematics, Peirce, Peirce's Law, Programming, Proof Theory, Propositions As Types Analogy, Spencer Brown, Type Theory and tagged , , , , , , , , , , , , , , . Bookmark the permalink.