Mathematical logic and foundations Proof theory Theorem
Cut-elimination theorem
Statement
Let be a sequent of first-order logic. If has a derivation in the sequent calculus LK, then it has a derivation in LK that does not use the cut rule. The same holds for the intuitionistic calculus LJ.
Remarks
Gentzen proved the theorem in 1934, and called it the Hauptsatz. The proof is a double induction. The outer induction is on the complexity of the cut formula, and the inner one is on the heights of the derivations above the cut. Each step pushes a topmost cut upward or replaces it by cuts on smaller formulas. The cost is large: removing cuts can make a derivation super-exponentially longer.
In a cut-free derivation, every formula is a subformula of a formula in the final sequent, up to the substitution of terms for variables. This subformula property gives quick consequences. For example, the empty sequent has no cut-free derivation, since no rule other than cut can produce it. So LK is consistent.
Going deeper
For a student
Cut elimination is the central result of structural proof theory. It gives the subformula property, the consistency of pure logic, and Craig interpolation and Herbrand's theorem by short arguments. For arithmetic, cuts cannot be fully removed in the presence of induction. Gentzen's consistency proof for Peano arithmetic instead removes cuts partly, with a transfinite induction up to the ordinal to show that the process ends. Through the Curry–Howard correspondence, the removal of cuts is related to the evaluation of programs.
Reading path
To understand this page from the ground up, read these 16 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Proposition concept
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Predicate definition
- Biconditional definition
- Law of excluded middle statement
- Modus ponens concept
- Propositional logic concept
- Mathematical proof concept
- Predicate logic concept
- Proof theory concept
- Sequent calculus definition
- Sequent calculus concept
- Cut-elimination theorem statement
Further reading
About this page
| Tag | AYRZ98Y0NW |
|---|---|
| URI | m2://AYRZ98Y0NW |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 03F05 |
| Status | This copy of the site has no build data. Run m2 status AYRZ98Y0NW. |
| About | Sequent calculus |
| Uses | Sequent calculus, Sequent calculus, Proof theory |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.