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
Read article at Wikipedia
Peirce's law
Facts from the Community
From the Proofs are Programs base
Key contribution:
| Date | Contributors | Why this is interesting | Key artifacts |
|---|---|---|---|
|
|
||
|
|
Similar topics in Freebase
-
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
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
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...