Tiering as a recursion technique

Bulletin of Symbolic Logic 11 (3):321-350 (2005)
  Copy   BIBTEX

Abstract

I survey the syntactic technique of tiering which can be used to restrict the power of a recursion scheme. I show how various results can be obtained entirely proof theoretically without the use of a model of computation

Links

PhilArchive



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

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

Generalized recursion theory.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York,: American Elsevier Pub. Co..
What is Radical Recursion?Steven M. Rosen - 2004 - SEED Journal 4 (1):38-57.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
A proof–technique in uniform space theory.Douglas Bridges & Luminiţa Vîţă - 2003 - Journal of Symbolic Logic 68 (3):795-802.
On the recursion theorem in iterative operative spaces.J. Zashev - 2001 - Journal of Symbolic Logic 66 (4):1727-1748.
Recursion theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - Providence, R.I.: American Mathematical Society.
Axiomatic recursion theory and the continuous functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.

Analytics

Added to PP
2009-01-28

Downloads
78 (#199,436)

6 months
4 (#404,301)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The realm of primitive recursion.Harold Simmons - 1988 - Archive for Mathematical Logic 27 (2):177-188.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
A new "feasible" arithmetic.Stephen Bellantoni & Martin Hofmann - 2002 - Journal of Symbolic Logic 67 (1):104-116.

View all 6 references / Add more references