Skip to main content
SpringerLink
Log in

Theories and Ordinals in Proof Theory

  • Published:
Synthese Aims and scope Submit manuscript

Astract

How do ordinals measure the strength and computational power of formal theories? This paper is concerned with the connection between ordinal representation systems and theories established in ordinal analyses. It focusses on results which explain the nature of this connection in terms of semantical and computational notions from model theory, set theory, and generalized recursion theory.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • H. Bachmann (1950) ArticleTitle‘Die Normalfunktionen und das Problem der ausgezeichneten Folgen von Ordinalzahlen’. Vierteljahresschrift Naturforsch Ges. Zürich 95 115–147

    Google Scholar 

  • J. Barwise (1975) Admissible Sets and Structures Springer Berlin

    Google Scholar 

  • W. Buchholz (1986) ArticleTitle‘A New System of Proof-Theoretic Ordinal Functions’ Annals of Pure and Applied Logic 32 195–207 Occurrence Handle10.1016/0168-0072(86)90052-7

    Article  Google Scholar 

  • W. Buchholz S. Feferman W. Pohlers W. Sieg (1981) Iterated Inductive Definitions and Subsystems of Analysis Springer Berlin

    Google Scholar 

  • W. Buchholz K. Schütte (1988) Proof Theory of Impredicative Subsystems of Analysis Bibliopolis Naples

    Google Scholar 

  • T. Carlson (1999) ArticleTitle‘Ordinal Arithmetic and Σ1 Elementarity’ Archive for Mathematical Logic 38 449–460 Occurrence Handle10.1007/s001530050150

    Article  Google Scholar 

  • T. Carlson (2001) ArticleTitle‘Elementary Patterns of Resemblance’ Annals of Pure and Applied Logic 108 19–77 Occurrence Handle10.1016/S0168-0072(00)00040-3

    Article  Google Scholar 

  • K. Devlin (1984) Constructibility Springer Berlin

    Google Scholar 

  • Feferman, S.: 1987, ‘Proof Theory: A Personal Report’, in G. Takeuti (ed.), Proof Theory. 2nd ed., North-Holland, Amsterdam, pp. 445–485.

  • S. Feferman (1988) ArticleTitle‘Hilbert’s Program Relativized: Proof-theoretical and Foundational Reductions’ The Journal of Symbolic Logic 53 364–384 Occurrence Handle10.2307/2274509

    Article  Google Scholar 

  • G. Gentzen (1936) ArticleTitle‘Die Widerspruchsfreiheit der reinen Zahlentheorie’ Mathematische Annalen 112 493–565 Occurrence Handle10.1007/BF01565428

    Article  Google Scholar 

  • D. Hilbert P. Bernays (1938) Grundlagen der Mathematik II Springer Berlin

    Google Scholar 

  • P. Hinman (1978) Recursion-Theoretic Hierarchies Springer Berlin

    Google Scholar 

  • G. Jäger (1982) ArticleTitle‘Zur Beweistheorie der Kripke–Platek Mengenlehre über den natürlichen Zahlen’ Archiv für Mathematische Logik 22 121–139 Occurrence Handle10.1007/BF02297652

    Article  Google Scholar 

  • Jäger, G. and W. Pohlers: 1982, ‘Eine beweistheoretische Untersuchung von Δ 12 − CA + BI und verwandter Systeme’, Sitzungsberichte der Bayerischen Akademie der Wissenschaften, Mathematisch-Naturwissenschaftliche Klasse (1982).

  • Jensen R.B., Karp C. (1971) ‘The Primitive Recursive Set Functions’. In Scott D. (ed). Axiomatic Set Theory. Proc. Symp. Pure Math 13 American Mathematical Society, Providence, pp.143–167

  • M. Möllerfeld M. Rathjen (2002) ArticleTitle‘A Note on the Σ1 Spectrum of a Theory’ Archive for Mathematical Logic 41 33–34 Occurrence Handle10.1007/s001530200001

    Article  Google Scholar 

  • Moschovakis Y.N. 1976, Recursion in the Universe of Sets. mimeographed note.

  • Normann, D.: 1978, ‘Set Recursion’, in Fenstad et al. (eds.), Generalized Recursion Theory II. North-Holland, Amsterdam, pp. 303–320.

  • M. Rathjen (1991) ArticleTitle‘Proof-Theoretic Analysis of KPM’ Archive for Mathematical Logic 30 377–403 Occurrence Handle10.1007/BF01621475

    Article  Google Scholar 

  • M. Rathjen (1992) ArticleTitle‘A Proof-Theoretic Characterization of the Primitive Recursive Set Functions’ Journal of Symbolic Logic 57 954–969 Occurrence Handle10.2307/2275441

    Article  Google Scholar 

  • Rathjen, M.: 1992, ‘Fragments of Kripke–Platek Set Theory with Infinity’, in P. Aczel, H. Simmons and S. Wainer (eds.), Proof Theory. Cambridge University Press, pp. 251–273.

  • M. Rathjen (1993) ArticleTitle‘How to Develop Proof-Theoretic Ordinal Functions on the Basis of Admissible Sets’ Mathematical Quarterly 39 47–54

    Google Scholar 

  • M. Rathjen (1994) ArticleTitle‘Collapsing Functions Based on Recursively Large Ordinals: A Well-ordering Proof for KPM’ Archive for Mathematical Logic 33 35–55 Occurrence Handle10.1007/BF01275469

    Article  Google Scholar 

  • M. Rathjen (1994) ArticleTitle‘Proof Theory of Reflection’ Annals of Pure and Applied Logic 68 181–224 Occurrence Handle10.1016/0168-0072(94)90074-4

    Article  Google Scholar 

  • Rathjen M.: 1999, ‘The Realm of Ordinal Analysis’, in S. Cooper and J. Truss (eds.), Sets and Proofs. Cambridge University Press, pp. 219–279.

  • W. Richter P. Aczel (1973) ‘Inductive Definitions and Reflecting Properties of Admissible Ordinals’ J.E. Fenstad P. Hinman (Eds) Generalized Recursion Theory North Holland Amsterdam 301–381

    Google Scholar 

  • G.E. Sacks (1990) Higher Recursion Theory Springer Berlin

    Google Scholar 

  • Schlüter A (1993). Zur Mengenexistenz in formalen Theorien der Mengenlehre. University of Münster, Thesis

  • Schlüter, A.: 1995, ‘Provability in Set Theories with Reflection’, preprint.

  • K. Schütte S. Simpson (1985) ArticleTitle‘Ein in der Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen’ Archiv für Mathematische Logik und Grundlagenforschung 25 75–89 Occurrence Handle10.1007/BF02007558

    Article  Google Scholar 

  • S. Simpson (1999) Subsystems of Second-Order Arithmetic Springer Berlin

    Google Scholar 

  • Thiel N. (2003) Metapredicative Set Theories and Provable Ordinals. Ph.D. thesis, University of Leeds.

  • van de Wiele, J.: 1982, ‘Recursive Dilators and Generalized Recursion’, in Proceedings of Herbrand Symposium. North-Holland, Amsterdam, pp. 325–332.

Download references

Author information

Authors and Affiliations

  1. Department of Pure Mathematics, University of Leeds, Leeds, LS2 9JT, Great Britain

    Michael Rathjen

Authors
  1. Michael Rathjen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Rathjen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rathjen, M. Theories and Ordinals in Proof Theory. Synthese 148, 719–743 (2006). https://doi.org/10.1007/s11229-004-6297-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11229-004-6297-0

Keywords

Search

Navigation