Characterizing the elementary recursive functions by a fragment of Gödel's T

Archive for Mathematical Logic

Volumn 39, Issue 7, 2000, Pages 475-491

  Beckmann, Arnold ^a   Weiermann, Andreas ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034360168     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050160     Document Type: Article

References (18)

1. Beckmann, A., Weiermann, A.: A term rewriting characterization of the polytime functions and related complexity classes. Archive for Mathematical Logic 36(1996), 11-30.
2. Beckmann, A. and Weiermann, A.: Investigations on subrecursion via logic programming. The Journal of Symbolic Logic (to appear).
3. Beckmann, A.: Exact bounds for lengths of reductions in typed λ-calculus. Preprint, Münster (1998) (submitted)
4. Bellantoni, S. and Cook, S.: A new recursion-theoretic characterization of the polytime functions. Comput. Complexity 2, No. 2 (1992), 97-110.
5. Cichon, E.A. and Weiermann, A.: Term rewriting theory for the primitive recursive functions. Annals of Pure and Applied Logic 83 (1997), 199-223.
6. Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. Proc. 2nd ALP. Lecture Notes in Computer Science 463 (1990), 347-358.
7. W. Howard: Assignment of ordinals to terms for primitive recursive functionals of finite type. Intuitionism and Proof Theory. North-Holland, Amsterdam 1970, 443-458.
8. D. Leivant: Predicative recurrence in finite type. In A. Nerode and Y.V. Matiyasevich (eds.), Logical Foundations of Computer Science. Springer Lecture Notes in Computer Science 813 (1994), 227-239.
9. D. Leivant: Ramified recurrence and computational complexity I: Word recurrence and poly-time. Feasible Mathematics II, P. Clote and J. Remmel (eds.), Perspectives in Computer Science. Birkhäuser (1995).
10. Möllerfeld, M. and Weiermann, A.: A uniform approach to ≺-recursion. Preprint, Münster (1995).
11. H.E. Rose: Subrecursion: Functions and Hierarchies. Oxford University Press 1984.
12. Simmons, H.: The realm of primitive recursion. Arch. Math. Logic 27 (1988), 177-188.
13. K. Schütte: Proof Theory. Springer 1977.
14. Weiermann, A.: Termination proofs for term rewriting systems by lexicographic path orderings yield multiply recursive derivation lengths. Theoretical Computer Science 139 (1995), 355-362.
15. Weiermann, A.: Rewriting theory for the Hydra battle and the extended Grzegorczyk hierarchy, Preprint, Nancy and Münster (1995) The Journal of Symbolic Logic (to appear).
16. Weiermann, A.: A proof of strongly uniform termination for Gödel's T by methods from local predicativity. Archive for Mathematical Logic 36 (1997), 445-460.
17. Weiermann, A.: How is it that infinitary methods can be applied to finitary mathematics. Gödel's T: a case study. The Journal of Symbolic Logic 63, Number 4, (1998), 1348-1370.
18. Wilken, G. and Weiermann, A.: Sharp upper bounds for the depths of reduction trees of typed lambda calculus with recursors. Preprint, Münster (1998).