A jump operator on honest subrecursive degrees

Archive for Mathematical Logic

Volumn 37, Issue 2, 1998, Pages 105-125

  Kristiansen, Lars ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032222174     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050086     Document Type: Article

References (20)

1. Ambos-Spies, K.: On the structure of polynomial time degrees of recursive sets. (Habilitationsschrift) Forschungsbericht Nr. 206/1985. Universität Dortmund, Dortmund, Germany 1985 (P.O. Box 500500, D-4600 Dortmund 50)
2. Basu, S.K.: On classes of computable functions. Conference record of the ACM symp. on theory of computing 1969, 55-59
3. Basu, S.K.: On the structure of subrecursive degrees. Journal of Computer and System Sciences 4, 452-464 (1970)
4. Grzegorczyk, A.: Some classes of recursive functions. Rozprawy Matematyczne No. IV, Warszawa, 1953
5. Heaton, A.J., and Wainer S.S.: Axioms for subrecursion theories. Computability, enumerability, unsolvability, (eds. Cooper, Slaman, Wainer) 123-138. LMS Lecture Note Series 224, Cambrigde University Press 1996
6. Kristiansen, L.: Information content and computational complexity of recursive sets. Gödel '96. Logical Foundations of Mathematics, Computer Science and Physics - Kurt Gödel Legacy, (eds. Hajék) 235-246. Springer Lecture Notes in Logic, Springer-Verlag 1996
7. Kristiansen, L.: On some classes of subrecursive functions. Norsk Informatikkonferanse '94, 33-52. ISBN 82-519-1428-0 Tapir 1994
8. Kristiansen, L.: Papers on subrecursion theory. Dr Scient Thesis, ISSN 0806-3036, ISBN 82-7368-130-0, Research report 217, Department of Informatics, University of Oslo 1996
9. Ladner, R. E.: On the structure of polynomial time reducibility. Journal of the Association for Computing Machinery 22, 155-171 (1975)
10. Machtey, M.: Classification of the computable functions by primitive recursive classes. Proc. 3rd ACM Symp. Thy. Comp. 1971, 251-257
11. Machtey, M.: Augmented loop languages and classes of computable functions. Journal of Computer and System Sciences 6, 603-624 (1972)
12. Machtey, M.: The honest subrecursive classes are a lattice. Information and Control 24, 247-263 (1974)
13. Machtey, M.: On the density of honest subrecursive classes. Journal of Computer and System Sciences 10, 183-199 (1975)
14. Meyer A.R., Ritchie D.M.: A classification of the recursive functions. Zeitschr. f. math. Logik und Grundlagen d. Math. Bd. 18, 71-82 (1972)
15. Oddifreddi, P.: Classical recursion theory. Amsterdam London New York Tokyo: North-Holland 1989
16. Péter, R.: Rekursive Funktionen. Budapest: Verlag der Ungarischen Akademie der Wissenschaften 1957 [English translation: New York: Academic Press 1967]
17. Rogers, H.: Theory of recursive functions and effective computability. Cambridge-Massachusetts London: The MIT Press 1987
18. Rose, H. E.: Subrecursion. Functions and hierarchies. Oxford: Clarendon Press 1984
19. Simmons, H.: A density property of the primitive recursive degrees. Technical Report Series UMCS-93-1-1, Department of Computer Science, University of Manchester 1993
20. Soare, R. I.: Recursive enumerable sets and degrees. Berlin Heidelberg New York London Paris Tokyo: Springer-Verlag 1987