Oxford University Press (1984)

Abstract This article has no associated abstract. (fix it)
Keywords Recursive functions  Recursion theory Hierarchies  Computable functions
Categories (categorize this paper)
Buy this book $176.26 used   Amazon page
Call number QA9.615.R67 1984
ISBN(s) 0198531893   9780198531890
DOI 10.2307/2274410
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: 64,132
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

No references found.

Add more references

Citations of this work BETA

Number Theory and Elementary Arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
Herbrand Analyses.Wilfried Sieg - 1991 - Archive for Mathematical Logic 30 (5-6):409-441.
Elementary Descent Recursion and Proof Theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
Bounded Arithmetic for NC, ALogTIME, L and NL.P. Clote & G. Takeuti - 1992 - Annals of Pure and Applied Logic 56 (1-3):73-117.

View all 29 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
44 ( #245,039 of 2,454,731 )

Recent downloads (6 months)
6 ( #117,600 of 2,454,731 )

How can I increase my downloads?

Downloads

My notes