Peirce's law

Peirce's law in logic is named after the philosopher and logician Charles Sanders Peirce. It was taken as an axiom in his first axiomatisation of propositional logic. In propositional calculus, Peirce's law says that ((P→Q)→P)→P. Written out, this means that P must be true if there is a proposition Q such that the truth of P follows from the truth of if P then Q. In particular, when Q is taken to be a false formula, the law says that if P must be... more

Facts from the Community

From the Proofs are Programs base

Key contribution:

Date Contributors Why this is interesting Key artifacts
  • 1990
  • In 1990, Griffin showed that Peirce's Law is the type of the continuation operator call/cc in Scheme. This remarkable observation demonstrates the relevance of the Curry-Howard correspondence even to control operators in programming languages.
  • 1885
  • Peirce axiomized propositional logic in the 19th century, and one of his axioms, now known as Peirce's law, implies the law of excluded middle. It wasn't until 115 years later that its relationship to programming languages was discovered.
View entire collection »
top ↑

Similar topics in Freebase

  • Russell's paradox

    Russell's paradox

    In the foundations of mathematics, Russell's paradox (also known as Russell's antinomy), discovered by Bertrand Russell in 1901, showed that the naive set theory of Frege leads to a contradiction. It might be assumed that, for any formal criterion, a set exists whose members are those objects (and...
  • Sequent calculus

    Sequent calculus

    In proof theory and mathematical logic, sequent calculus is a widely known family of formal systems sharing a certain style of inference and certain formal properties. The first sequent calculi, systems LK and LJ, were introduced by Gerhard Gentzen in 1934, as a tool for studying (respectively,...
  • Curry–Howard correspondence

    Curry–Howard correspondence

    The Curry–Howard correspondence is the direct relationship between computer programs and mathematical proofs. Also known as Curry–Howard isomorphism, proofs-as-programs correspondence and formulae-as-types correspondence, it refers to the generalization of a syntactic analogy between systems of...

These people have edited this topic:

Edit this topic
Edit and Show details

Add or delete facts, download data in JSON or RDF formats, and explore topic metadata.

Freebase Logo
What is Freebase?

Freebase is a huge collection of facts, built by people like you. Freebase connects facts in ways other sites can't, giving you new ways to explore millions of subjects.
You can help improve it!

Freebase Attribution

Freebase data is free for use under the CC-BY license.

The original description for Peirce's law was automatically generated from Wikipedia.org licensed under the GNU Free Documentation License.
[1]
Learn more about Freebase licensing and attribution