How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals

Mathematical Logic Quarterly 39 (1):47-54 (1993)
  Copy   BIBTEX

Abstract

In ordinal analysis of impredicative theories so-called collapsing functions are of central importance. Unfortunately, the definition procedure of these functions makes essential use of uncountable cardinals whereas the notation system that they call into being corresponds to a recursive ordinal. It has long been claimed that, instead, one should manage to develop such functions directly on the basis of admissible ordinals. This paper is meant to show how this can be done. Interpreting the collapsing functions as operating directly on admissible sets also renders a new and perspicuous approach to well-ordering proofs possible. MSC: 03F15, 03F35

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An ordinal analysis of stability.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (1):1-62.
Proof theory and ordinal analysis.W. Pohlers - 1991 - Archive for Mathematical Logic 30 (5-6):311-376.
Ordinal diagrams for Π3-reflection.Toshiyasu Arai - 2000 - Journal of Symbolic Logic 65 (3):1375 - 1394.
Fruitful and helpful ordinal functions.Harold Simmons - 2008 - Archive for Mathematical Logic 47 (7-8):677-709.
An ordinal analysis of parameter free Π12-comprehension.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (3):263-362.
Normal forms for elementary patterns.Timothy J. Carlson & Gunnar Wilken - 2012 - Journal of Symbolic Logic 77 (1):174-194.
Assignment of Ordinals to Patterns of Resemblance.Gunnar Wilken - 2007 - Journal of Symbolic Logic 72 (2):704 - 720.
Ordinal diagrams for recursively Mahlo universes.Toshiyasu Arai - 2000 - Archive for Mathematical Logic 39 (5):353-391.

Analytics

Added to PP
2013-12-01

Downloads
21 (#720,615)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michael Rathjen
University of Leeds

Citations of this work

Proof theory of reflection.Michael Rathjen - 1994 - Annals of Pure and Applied Logic 68 (2):181-224.
An ordinal analysis of stability.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (1):1-62.
Well-ordering proofs for Martin-Löf type theory.Anton Setzer - 1998 - Annals of Pure and Applied Logic 92 (2):113-159.
The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.

View all 11 citations / Add more citations

References found in this work

Proof theory.K. Schütte - 1977 - New York: Springer Verlag.
Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.
Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.

Add more references