Goodstein sequences for prominent ordinals up to the Bachmann–Howard ordinal

&
Annals of Pure and Applied Logic 163 (6):669-680 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2011.11.006

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Goodstein sequences for prominent ordinals up to the Bachmann–Howard ordinal.Michiel De Smet & Andreas Weiermann - 2012 - Annals of Pure and Applied Logic 163 (6):669-680.
Goodstein sequences for prominent ordinals up to the ordinal of Π11 -CAo.Andreas Weiermann & Gunnar Wilken - 2013 - Annals of Pure and Applied Logic 164 (12):1493-1506.
Ptykes in GödelsT und Definierbarkeit von Ordinalzahlen.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (2):119-141.
The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.
Some Uses of Dilators in Combinatorial Problems. II.V. Michele Abrusci, Jean-Yves Girard & Jacques van de Wiele - 1990 - Journal of Symbolic Logic 55 (1):32 - 40.
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results.Andreas Weiermann - 2005 - Annals of Pure and Applied Logic 136 (1):189-218.
A comparison of two systems of ordinal notations.Harold Simmons - 2004 - Archive for Mathematical Logic 43 (1):65-83.
The strength of Martin-Löf type theory with a superuniverse. Part II.Michael Rathjen - 2001 - Archive for Mathematical Logic 40 (3):207-233.
The strength of Martin-Löf type theory with a superuniverse. Part I.Michael Rathjen - 2000 - Archive for Mathematical Logic 39 (1):1-39.
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.
Post’s Problem for ordinal register machines: An explicit approach.Joel David Hamkins & Russell G. Miller - 2009 - Annals of Pure and Applied Logic 160 (3):302-309.
Intermediate predicate logics determined by ordinals.Pierluigi Minari, Mitio Takano & Hiroakira Ono - 1990 - Journal of Symbolic Logic 55 (3):1099-1124.
Γ0 May Be Minimal Subrecursively Inaccessible.Andreas Weiermann - 2001 - Mathematical Logic Quarterly 47 (3):397-408.
Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
Bounds for the closure ordinals of essentially monotonic increasing functions.Andreas Weiermann - 1993 - Journal of Symbolic Logic 58 (2):664-671.

Analytics

Added to PP
2017-02-19

Downloads
15 (#849,371)

6 months
3 (#643,273)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

On the restricted ordinal theorem.R. L. Goodstein - 1944 - Journal of Symbolic Logic 9 (2):33-41.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
The slow-growing and the grzecorczyk hierarchies.E. A. Cichon & S. S. Wainer - 1983 - Journal of Symbolic Logic 48 (2):399-408.
Some uses of dilators in combinatorial problems.V. Michele Abrusci - 1989 - Archive for Mathematical Logic 29 (2):85-109.

View all 6 references / Add more references