Skip to main content

Hightlights in Proof Theory

  • Chapter
Proof Theory

Part of the book series: Synthese Library ((SYLI,volume 292))

Abstract

This is a survey of some of the principal developments in proof theory from its inception in the 1920s, at the hands of David Hilbert, up to the 1960s. Hilbert’s aim was to use this as a tool in his finitary consistency program to eliminate the “actual infinite” in mathematics from proofs of purely finitary statements. One of the main approaches that turned out to be the most useful in pursuit of this program was that due to Gerhard Gentzen, in the 1930s, via his calculi of “sequents” and his Cut-Elimination Theorem for them. Following that we trace how and why prima facie infinitary concepts, such as ordinals, and infinitary methods, such as the use of infinitely long proofs, gradually came to dominate proof-theoretical developments.

This is the first of three lectures that I delivered at the conference, Proof Theory: History and Philosophical Significance, held at the University of Roskilde, Denmark, Oct. 31—Nov. 1, 1997. I wish to thank the organizers, Prof. Stig Andur Pedersen and Prof. Vincent F. Hendricks for inviting me to present these lectures, and especially for their substantial work in preparing them for publication with the assistance of Mr. Klaus Frovin Jørgensen, from their audio tapes and my transparencies. I have edited the resulting articles for coherence and readability, but otherwise have maintained their character as lectures, as originally given.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aczel, P. Simmons, H. and Wainer, S. (eds.), (1992). Proof Theory. Cambridge: Cambridge University Press.

    Google Scholar 

  2. Avigad, J. and Feferman, S. (1998). “Gödel’s functional (`Dialectics’) interpretation”, in [Buss 1998 ]: 337–405.

    Google Scholar 

  3. Buchholz, W., Feferman, S., Pohlers, W. and Sieg, W., (1981). Iterated Inductive Definitions and Subsyterns of Analysis. Recent Proof-theoretical Studies. Lecture Notes in Mathematics 897, Berlin: Springer.

    Google Scholar 

  4. Buchholz, W., (1997). “Explaining Gentzen’s consistency proof within infinitary proof theory”, in Gottlob, G. et al. (eds.), Computational Logic and Proof Theory, KGC `97,Lecture Notes in Computer Science 1289, Berlin: Springer.

    Google Scholar 

  5. Buchholz, W. and Schütte, K., (1988). Proof Theory of Im-predicative Systems. Naples: Bibliopolis.

    Google Scholar 

  6. Buss, S. R. (ed.), (1998). Handbook of Proof Theory. Amsterdam: North Holland

    Google Scholar 

  7. Buss, S. R., (1998). “An introduction to proof theory”, in: 1–78.

    Google Scholar 

  8. Buss, S. R., (1998). “First-order proof theory of arithmetic”, in [Buss 1998 ]: 79–147.

    Google Scholar 

  9. Dreben, B. and Denton, J., (1970). “Herbrand-style consistency proofs”, in [Kino et al. 1970 ]: 419–433.

    Google Scholar 

  10. Fairtlough, M. and Wainer, S. S., (1998). “Hierarchies of provably recursive functions”, in [Buss 1998 ]: 149–207.

    Google Scholar 

  11. Feferman, S., (1987). “Proof theory. A personal report”, appendix to [Takeuti 1987 ]: 447–485.

    Google Scholar 

  12. Feferman, S., (1988). “Hilbert’s program relativized. Prooftheoretical and foundational reductions”, Journal of Symbolic Logic, 53: 364–384.

    Article  Google Scholar 

  13. Gentzen, G., (1969). The Collected Papers of Gerhard Gentzen. Szabo, M. (ed.), Amsterdam: North Holland.

    Google Scholar 

  14. Girard, J., (1987) Proof Theory and Logical Complexity. Naples: Bibliopolis.

    Google Scholar 

  15. Hilbert, D. and Bernays, P., (1968). Grundlagen der Mathematik, Vol. I. 2nd edn. Berlin: Springer. Ibid. Vol. II, (2d ed. Berlin: Springer, 1970 ).

    Google Scholar 

  16. Jäger, G., (1986). Theories for Admissible Sets. A Unifying approach to Proof Theory. Naples Bibliopolis.

    Google Scholar 

  17. Kino, A., Myhill, J. and Vesley, R. E. (eds.), (1970). Intuitionism and Proof Theory. Amsterdam: North Holland

    Google Scholar 

  18. Kreisel, G., (1965). “A survey of proof theory”, Journal of Symbolic Logic, 33: 321–388.

    Article  Google Scholar 

  19. Mints, G. E., (1991). “Proof theory in the USSR 1925–1969”, Journal of Symbolic Logic, 56: 385–423.

    Article  Google Scholar 

  20. Mints, G. E., (1992). Selected Papers in Proof Theory. Naples: Bibliopolis.

    Google Scholar 

  21. Mints, G. E., (1991). “Gentzen-type systems and Hilbert’s epsilon substitution method. I”, in Logic, Methodology and Philosophy of Science IX, Prawitz, D. et al., (eds.), Amsterdam: North Holland: 91–122.

    Google Scholar 

  22. Prawitz, D., (1965). Natural Deduction. Stockholm: Almqvist & Wiksell.

    Google Scholar 

  23. Pohlers, W., (1987). “Contributions of the Schütte school in Munich to proof theory”, appendix to [Takeuti 1987]: 406–431.

    Google Scholar 

  24. Pohlers, W., (1989). Proof Theory. An Introduction. Lecture Notes in Mathematics 1407, Berlin: Springer.

    Google Scholar 

  25. Pohlers, W., (1998). “Subsystems of set theory and second order number theory”, in [Buss 1998]: 209–335.

    Google Scholar 

  26. Rathjen, M., (1995). “Recent advances in ordinal analysis: flCA and related systems”, Bulletin of Symbolic Logic, 1: 4684–85.

    Article  Google Scholar 

  27. Schwichtenberg, H., (1997). “Proof theory: some applications of cut-elimination”, in Handbook of Mathematical Logic, Bar-wise, J., (ed.), Amseterdam: North Holland: 867–895.

    Google Scholar 

  28. Sieg, W., (1998). “Hilbert’s program sixty years later”, Journal of Symbolic Logic, 53: 338–348.

    Article  Google Scholar 

  29. Simpson, S. G., (1988). “Partial realizations of Hilbert’s program”, Journal of Symbolic Logic, 53: 349–363.

    Article  Google Scholar 

  30. Schütte, K., (1960). Beweistheorie. Berlin: Springer

    Google Scholar 

  31. Schütte, K., (1977). Proof Theory. Berlin: Springer.

    Book  Google Scholar 

  32. Tait, W., (1965). “The substitution method”, Journal of Symbolic Logic, 30: 175–192.

    Google Scholar 

  33. Tait, W., (1965). “Normal derivability in classical logic”, in The Syntax and Semantics of Infinitary Languages, Barwise, J. (ed.), Lecture Notes in Mathematics 72, Berlin: Springer: 204–236.

    Chapter  Google Scholar 

  34. Takeuti, G., (1987). Proof Theory. 2nd edn. Amsterdam: North Holland.

    Google Scholar 

  35. Troelstra, A. S., Schwichtenberg, H., (1996). Basic Proof Theory. Cambridge: Cambridge University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Feferman, S. (2000). Hightlights in Proof Theory. In: Hendricks, V.F., Pedersen, S.A., Jørgensen, K.F. (eds) Proof Theory. Synthese Library, vol 292. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2796-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-2796-9_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5553-8

  • Online ISBN: 978-94-017-2796-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics