Chapter III Hierarchies of provably recursive functions

Studies in Logic and the Foundations of Mathematics

Volumn 137, Issue C, 1998, Pages 149-207

  Fairtlough, Matt ^a   Wainer, Stanley S ^b  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

^b UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745286388     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(98)80018-9     Document Type: Chapter

References (59)

1. Ackermann W. Zur Widerspruchsfreiheit der Zahlenentheorie. Mathematische Annalen 117 (1940) 162-194
2. Arai T. A slow growing analogue of Buchholz' proof. Annals of Pure and Applied Logic 54 (1991) 101-120
3. Avigad J., and Sommer R. A model-theoretic approach to ordinal analysis. Bulletin of Symbolic Logic 3 (1997) 17-52
4. 1 -CA)+(BI). Annals of Pure and Applied Logic 23 (1987) 131-155
5. Buchholz W., Cichon E.A., and Weiermann A. A uniform approach to fundamental sequences and subrecursive hierarchies. Mathematical Logic Quarterly 40 (1994) 273-286
6. Buchholz W., Feferman S., Pohlers W., and Sieg W. Iterated Inductive Definitions and Subsystems of Analysis. Lecture Notes in Mathematics #897 (1981), Springer-Verlag, Berlin
7. Buchholz W., and Wainer S.S. Provably computable functions and the fast growing hierarchy. In: Simpson S.G. (Ed). Logic and Combinatorics. vol. 65 of Contemporary Mathematics (1987), American Mathematical Society, Providence, R.I. 179-198
8. Buss S.R. The witness function method and provably recursive functions of Peano Arithmetic. In: Prawitz D., Skyrms B., and Westerstahl D. (Eds). Proceedings of the 9th. International Congress of Logic, Methodology and Philosophy of Science (1994), North-Holland, Amsterdam
9. Cichon E.A. A short proof of two recently discovered independence proofs using recursion theoretic methods. Proceedings of the American Mathematical Society 87 (1983) 704-706
10. Cichon E.A., and Wainer S.S. The slow growing and Grzegorczyk hierarchies. Journal of Symbolic Logic 48 (1983) 399-408
11. Constable R.L. Subrecursive programming languages III, the multiple recursive functions. Proceedings of the 21st International Symposium on Computers and Automata. Brooklyn Polytechnic Institute, NY (1971) 393-410
12. Cutland N.J. Computability (1981), Cambridge University Press
13. Fairtlough M.V.H. Ordinal Complexity of Recursive Programs and their Termination Proofs. PhD thesis (1991), Leeds University Department of Pure Mathematics
14. Fairtlough M.V.H., and Wainer S.S. Ordinal complexity of recursive definitions. Information and Computation 99 (1992) 123-153
15. Feferman S. Classification of recursive functions by means of hierarchies. Journal of the American Mathematical Society 104 (1962) 101-122
16. Feferman S. Systems of predicative analysis II. Journal of Symbolic Logic 33 (1968) 193-220
17. Friedman H.M. Classically and intuitionistically provably recursive function. In: Müller G.H., and Scott D.S. (Eds). Proc. Higher Set Theory, Oberwolfach. Lecture Notes in Mathematics #669 (1978), Springer-Verlag, Berlin 21-27
18. Friedman H.M., and Sheard M. Elementary descent recursion and proof theory. Annals of Pure and Applied Logic 71 (1995) 1-45
19. Gentzen G. Die Widerspruchsfreiheit der reinen Zahlentheorie. Mathematische Annalen 112 (1936) 493-565
20. Gentzen G. Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der Transfiniten Induction in der reiner Zahlentheorie. Mathematische Annalen 119 (1943) 140-161
21. 1 -logic part I. Annals of Mathematical Logic 21 (1981) 75-219
22. Girard J.-Y. Proof Theory and Logical Complexity (1987), Bibliopolis, Naples
23. Grzegorczyk A. Some classes of recursive functions. Rozprawy Matem. IV, Warsaw (1953)
24. Hajek P., and Pudlak P. The Metamathematics of First Order Arithmetic. Perspectives in Mathematical Logic (1991), Springer-Verlag, Berlin
25. Hardy G.H. A theorem concerning the infinite cardinal numbers. Quarterly Journal of Mathematics 35 (1904) 87-94
26. Howard W.A. A system of abstract constructive ordinals. Journal of Symbolic Logic 37 (1970) 355-374
27. Kadota N. On Wainer's notation for a minimal subrecursive inacessible ordinal. Mathematical Logic Quarterly 39 (1993) 217-227
28. Ketonen J., and Solovay R.M. Rapidly growing Ramsey functions. Annals of Mathematics 113 (1981) 267-314
29. Kirby L.A.S., and Paris J.B. Accessible independence results for Peano Arithmetic. Bulletin of the American Mathematical Society (1982) 285-293
30. Kreisel G. On the interpretation of non-finitist proofs II. Journal of Symbolic Logic 17 (1952) 43-58
31. Leivant D. Intrinsic theories and computational complexity. In: Leivant D. (Ed). Logic and Computational Complexity, International Workshop LCC'94. Lecture Notes in Computer Science #960 (1995), Springer-Verlag, Berlin 177-194
32. Löb M.H., and Wainer S.S. Hierarchies of number theoretic functions I and II. Arkiv für mathematische Logik und Grundlagenforschung 14 (1970) 39-51
33. Correction in vol. 14, pages 198-199. Löb M.H., and Wainer S.S. Hierarchies of number theoretic functions I and II. Arkiv für mathematische Logik und Grundlagenforschung 14 (1970) 97-113
34. Mints G.E. Quantifier-free and one quantifier systems. Journal of Soviet Mathematics 1 (1973) 71-84
35. paris J.B. A hierarchy of cuts in models of arithmetic. In: Pacholski L., et al. (Ed). Model Theory of Algebra and Arithmetic. Lecture Notes in Mathematics #834 (1980), Springer-Verlag, Berlin 312-337
36. Paris J.B., and Harrington L. A mathematical incompleteness in Peano Arithmetic. In: Barwise J. (Ed). Handbook of Mathematical Logic (1977), North-Holland, Amsterdam 1133-1142
37. Parsons C. Ordinal recursion in partial systems of number theory (abstract). Notices of the American Mathematical Society 13 (1966) 857-858
38. Parsons C. On a number-theoretic choice schema and its relation to induction. Intuitionism and Proof Theory: proceedings of the summer conference. Buffalo N.Y. 1968 (1970), North-Holland, Amsterdam 459-473
39. Péter R. Recursive Functions. 3rd ed (1967), Academic Press, New York
40. Ratajczyk Z. Subsystems of true arithmetic and hierarchies of functions. Annals of Pure and Applied Logic 64 (1993) 95-152
41. Robbin J. Subrecursive Hierarchies. PhD thesis (1965), Princeton University
42. Rose H.E. Subrecursion: Functions and Hierarchies, vol. 9 of Oxford Logic Guides (1984), Clarendon Press, Oxford
43. Schmerl U. Number theory and the Bachmann-Howard ordinal. In: Stern J. (Ed). Logic Colloquium '81 (1982), North-Holland, Amsterdam 287-298
44. Schmidt D. Built-up systems of fundamental sequences and hierarchies of number-theoretic functions. Arkiv für mathematische Logik und Grundlagenforschung 18 (1976) 47-53
45. Translation by J. N. Crossley. Schütte K. Proof Theory (1977), Springer-Verlag, Berlin
46. 0 -rekursiven Functionen. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 17 (1971) 61-74
47. Schwichtenberg H. Proof theory: Some applications of cut-elimination. In: Barwise J. (Ed). Handbook of Mathematical Logic (1977), North-Holland, Amsterdam 867-895
48. Schwichtenberg H., and Wainer S.S. Ordinal bounds for programs. In: Clote P., and Remmel J.B. (Eds). Feasible mathematics II. vol. 13 of Progress in Computer Science and Applied Logic (1995), Birkhäuser, Boston 387-406
49. Sieg W. Fragments of arithmetic. Annals of Pure and Applied Logic 28 (1985) 33-71
50. Sieg W. Herbrand analyses. Archive for Mathematical Logic 30 (1991) 409-441
51. 0 . In: Clote P., and Krajicek J. (Eds). Arithmetic, Proof Theory and Computational Complexity (1992), Oxford University Press
52. Sommer R. Transfinite induction within Peano Arithmetic. Annals of Pure and Applied Logic 76 (1995) 231-289
53. Tait W.W. Normal derivability in classical logic. In: Barwise J. (Ed). The Syntax and Semantics of Infinitary Languages. Lecture Notes in Mathematics #72 (1968), Springer-Verlag, Berlin 204-236
54. Takeuti G. Proof Theory. 2nd ed (1987), North-Holland, Amsterdam
55. Tucker J.V., and Zucker J.I. Provable computable selection functions on abstract structures. In: Aczel P.H.G., Simmons H., and Wainer S.S. (Eds). Proof Theory (1992), Cambridge University Press 277-306
56. Wainer S.S. A classification of the ordinal recursive functions. Arkiv für mathematische Logik und Grundlagenforschung 13 (1970) 136-153
57. Wainer S.S. Ordinal recursion and a refinement of the extended Grzegorczyk hierarchy. Journal of Symbolic Logic 38 (1972) 281-292
58. Wainer S.S. Slow growing versus fast growing. Journal of Symbolic Logic 54 (1989) 608-614
59. Weiermann A. How to characterise provably total functions by local predicativity. Journal of Symbolic Logic 61 (1996) 52-69