Peirce's law
In logic, Peirce's law is named after the philosopher and logician Charles Sanders Peirce. It was taken as an axiom in his first axiomatisation of propositional logic. It can be thought of as the law of excluded middle written in a form that involves only one sort of connective, namely implication. 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 true whenever it implies falsity, then "P" is true. In this way Peirce's law implies the law of excluded middle. Peirce's law does not hold in intuitionistic logic or intermediate logics and cannot be deduced from the deduction theorem alone. Under the Curry–Howard isomorphism, Peirce's law is the type of continuation operators, e.g. call/cc in Scheme. History. Here is Peirce's own statement of the law: Peirce goes on to point out an immediate application of the law: Warning: (("x"→"y")→"a")→"x" is  not a tautology. However, ["a"→"x"]→[(("x"→"y")→"a")→"x"] is a tautology. Other proofs. Here is a simple proof of Peirce's law assuming double negation formula_1 and deriving the standard disjunction from an implication formula_2: formula_3 Using Peirce's law with the deduction theorem. Peirce's law allows one to enhance the technique of using the deduction theorem to prove theorems. Suppose one is given a set of premises Γ and one wants to deduce a proposition "Z" from them. With Peirce's law, one can add (at no cost) additional premises of the form "Z"→"P" to Γ. For example, suppose we are  given "P"→"Z" and ("P"→"Q")→"Z" and we wish to deduce "Z" so that we can use the deduction theorem to conclude that ("P"→"Z")→((("P"→"Q")→"Z")→"Z") is a theorem. Then we can add another premise "Z"→"Q". From that and "P"→"Z", we get "P"→"Q". Then we apply modus ponens with ("P"→"Q")→"Z" as the major premise to get "Z". Applying the deduction theorem, we get that ("Z"→"Q")→"Z" follows from the original premises. Then we use Peirce's law in the form (("Z"→"Q")→"Z")→"Z" and modus ponens to derive "Z" from the original premises. Then we can finish off proving the theorem as we originally intended. Completeness of  the implicational propositional calculus. One reason that Peirce's law is important is that it can substitute for the law of excluded middle in the logic which only uses implication. The sentences which can be deduced from the axiom schemas: (where "P","Q","R" contain only "→" as a connective) are all the tautologies which use only "→" as a connective.