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)
Call number QA9.615.R67 1984
ISBN(s) 0198531893  
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: 53,682
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.
Elementary Descent Recursion and Proof Theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
Herbrand Analyses.Wilfried Sieg - 1991 - Archive for Mathematical Logic 30 (5-6):409-441.
Two (or Three) Notions of Finitism.Mihai Ganea - 2010 - Review of Symbolic Logic 3 (1):119-144.

View all 27 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
32 ( #308,588 of 2,349,384 )

Recent downloads (6 months)
2 ( #330,956 of 2,349,384 )

How can I increase my downloads?

Downloads

My notes