Skip to main content

Reduction and Elimination

  • Chapter
  • First Online:
Methods of Cut-Elimination

Part of the book series: Trends in Logic ((TREN,volume 34))

  • 615 Accesses

Abstract

In Gentzen’s famous paper cut-elimination is a constructive method for proving the “Hauptsatz” which is used to constitute such important principles as the existence of a mid-sequent and the decidability of propositional intuitionistic logic. The idea of the Hauptsatz is connected to the elimination of ideal objects in mathematical proofs according to Hilbert’s program. In this sense LK (with the standard axiom set) is consistent because the empty sequent is not cut-free derivable; any proof of a contradiction would need ideal (indirect) arguments. By shift of emphasis mathematicians began to focus on the proof transformation by cut-elimination itself. In fact, cut-elimination is an essential tool for making implicit contents of proofs explicit. It also allows the construction of Herbrand disjunctions and interpolants for real mathematical proofs. Furthermore elementary proofs can be obtained from abstract ones; one of the most important examples from literature is the transformation of the Fürstenberg–Weiss proof into the original (van der Waerden’s) proof [40].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. G. Gentzen: Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39, pp. 405–431, 1934–1935.

    Article  MathSciNet  Google Scholar 

  2. J.Y. Girard: Proof Theory and Logical Complexity. In Studies in Proof Theory, Bibliopolis, Napoli, 1987.

    Google Scholar 

  3. K. Schütte: Beweistheorie. Springer, Berlin, 1960.

    MATH  Google Scholar 

  4. H. Schwichtenberg: Proof Theory: Some Applications of Cutelimination. In: J. Barwise (ed.), Handbook of Mathematical Logic, North Holland, Amsterdam, 1977.

    Google Scholar 

  5. W.W. Tait: Normal Derivability in Classical Logic. In: J. Barwise (ed.), The Syntax and Semantics of Infinitary Languages, Springer, Berlin, pp. 204–236, 1968.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthias Baaz .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Baaz, M., Leitsch, A. (2011). Reduction and Elimination. In: Methods of Cut-Elimination. Trends in Logic, vol 34. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0320-9_5

Download citation

Publish with us

Policies and ethics