Subrecursive degrees and fragments of Peano arithmetic

Archive for Mathematical Logic

Volumn 40, Issue 5, 2001, Pages 365-397

  Kristiansen, Lars ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035610209     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00003845     Document Type: Article

References (24)

1. Beklemishev, L.D.: A proof-theoretic analysis of collection, Archive for Mathematical Logic, 37, 275-296 (1998)
2. Beklemishev, L.D.: Induction rules, reflection principles, and provably recursive functions, Annals of Pure and Applied Logic, 85, 193-242 (1997)
3. Birkhoff, G.: Lattice theory. American Mathematical Society Colloquium Publications, Volume XXV (1967)
4. Cobham, S.K.: The intrinsic computational difficulty of functions. In: Bar-Hillel Y. (ed). Logic, methodology, and philosophy of science, North-Holland, Amsterdam (1965)
5. Grzegorczyk, A.: Some classes of recursive functions, Rozprawy Matematyczne No. IV, Warszawa (1953)
6. Hajék, P., Pudlák, P.: Metamathematics of first-order arithmetic, Springer Verlag Berlin Heidelberg (1993)
7. Heaton, A.J., 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)
8. Kristiansen, L.: A jump operator on honest subrecursive degrees, Archive for Mathematical Logic, 37, 105-125 (1998)
9. 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)
10. 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. (This report contains [8] and [9].)
11. n, and intermediate subrecursive degrees. In Calude and Dinneen (Eds.) Combinatorics, computation and logic. (Proceedings) Springer, Singapore 286-300 (1999)
12. Ladner, R.E.: On the structure of polynomial time reducibility, Journal of the Association of Computing Machinery, 22, 155-171 (1975)
13. Machtey, M.: Augmented loop languages and classes of computable functions, Journal of Computer and System Sciences, 6, 603-624 (1972)
14. Machtey, M.: The honest subrecursive classes are a lattice, Information and Control, 24, 247-263 (1974)
15. Machtey, M.: On the density of honest subrecursive classes, Journal of Computer and System Sciences, 10, 183-199 (1975)
16. 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)
17. Odifreddi, P.: Classical recursion theory. North-Holland (1989)
18. Parsons, C.: On n-quantifier induction, Journal of Symbolic Logic, 37, 466-482 (1972)
19. Péter, R.: Rekursive Funktionen. Verlag der Ungarischen Akademie der Wissenschaften, Budapest 1957. [English translation: Academic Press, New York 1967]
20. Rogers, H.: Theory of recursive functions and effective computability, McGraw Hill (1967)
21. Rose, H.E.: Subrecursion. Functions and hierarchies. Clarendon Press, Oxford (1984)
22. Sieg, W.: Herbrand analysis, Archive of Mathematical Logic, 30, 409-441 (1991)
23. Skolem, T.: Selected works in logic, (eds. Fenstad) Skandinavian University Books, Universitessforlaget, Oslo (1970)
24. Soare, R.I.: Recursive enumerable sets and degrees, Springer, Berlin (1987)