The Cut-Elimination Theorem states that any proof in a sequent-calculus system for first-order logic that uses the cut rule, which allows a lemma to be introduced and then discharged, can be transformed into a proof of the same statement that uses no cut rule at all. Named for Gerhard Gentzen, who called it his Hauptsatz, or main theorem, it shows every proof can in principle be reduced to one built entirely from the formula being proved, a fact with wide consequences for proof theory including consistency proofs and the subformula property.
Facts
StatementAny sequent that possesses a proof in the sequent calculus making use of the cut rule also possesses a cut-free proof, that is, a proof that does not make use of the cut rule. 1 Classification
Statement Form Sources
1. Cut-elimination theorem
Lead paragraph, third sentence
The cut-elimination theorem states that any sequent that possesses a proof in the sequent calculus making use of the cut rule also possesses a cut-free proof, that is, a proof that does not make use of the cut rule.
Lead paragraph, second sentence
It was originally proved by Gerhard Gentzen in part I of his landmark 1935 paper
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.