No label defined (Q4934564)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1390277
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1390277

      Statements

      0 references
      25 October 2000
      0 references
      survey lecture
      0 references
      ordinal analysis
      0 references
      collapsing function
      0 references
      Kripke-Platek set theory
      0 references
      ramified set theory
      0 references
      operator-controlled derivations
      0 references
      history of proof theory
      0 references
      provably recursive functions
      0 references
      combinatorial principles
      0 references
      Hercules-hydra game
      0 references
      graph minor theorem
      0 references
      This paper is based on a survey lecture. The author gives reflection on, and examples of ordinal analysis, as well as a report of results. Often, ordinal analysis of a theory \(T\) is conceived of as the determination of its proof-theoretic ordinal. But what is it? Is it \(|T |_{\text{con}}=\) the least \(\alpha\) such that transfinite induction up to \(\alpha\) proves the consistence of \(T\), or \(|T|_{\sup} =\sup\{\alpha/ T\vdash\alpha\) is recursive\}, or something else? These numbers depend, obviously, on ordinal representation systems used, but how? For \(|T|_{\text{con}}\), what does ``prove'' mean, e.g. in what system? How is ``\(\alpha\) is recursive'' expressed? Does that influence \(|T|_{\text{sup}}\)? Do these ordinals acurately reflect the strength of the theory? With comments and theorems, the author illustrates these foundational points which are usually passed over. Also, he comments on the use of the collapsing function technique. He demonstrates ordinal analysis on KP (= Kripke-Platek set theory) and KPM(=KP+ the first Mahlo number), using the language of ramified set theory, and operator-controlled derivations, a recently invented tool. On the reportorial side, the author offers a concise history of proof theory of the past five decades, comparisons of various theories, classifications of provably recursive functions, and non-provabilities of combinatorial principles such as the Hercules-hydra game and the graph minor theorem. For the entire collection see [Zbl 0919.00040].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references