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

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2011.11.006
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 55,825
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

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

Citations of this work BETA

Add more citations

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 index
2013-10-27

Total views
11 ( #790,505 of 2,401,549 )

Recent downloads (6 months)
1 ( #551,447 of 2,401,549 )

How can I increase my downloads?

Downloads

My notes