Subrecursion: Functions and Hierarchies

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 the book $24.00 used (47% off)   $75.89 new    Amazon page
Call number QA9.615.R67 1984
ISBN(s) 0198531893  
DOI 10.2307/2274410
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 20,481
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
Mihai Ganea (2010). Two (or Three) Notions of Finitism. Review of Symbolic Logic 3 (1):119-144.
Wilfried Sieg (1991). Herbrand Analyses. Archive for Mathematical Logic 30 (5-6):409-441.

View all 20 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

8 ( #389,569 of 1,902,049 )

Recent downloads (6 months)

5 ( #167,851 of 1,902,049 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.