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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,574

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

Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
Assignment of Ordinals to Patterns of Resemblance.Gunnar Wilken - 2007 - Journal of Symbolic Logic 72 (2):704 - 720.
Transfinite ordinals in recursive number theory.R. L. Goodstein - 1947 - Journal of Symbolic Logic 12 (4):123-129.
On the restricted ordinal theorem.R. L. Goodstein - 1944 - Journal of Symbolic Logic 9 (2):33-41.

Analytics

Added to PP
2013-10-27

Downloads
15 (#953,911)

6 months
1 (#1,478,830)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
On the restricted ordinal theorem.R. L. Goodstein - 1944 - Journal of Symbolic Logic 9 (2):33-41.
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