Term rewriting theory for the primitive recursive functions

Annals of Pure and Applied Logic

Volumn 83, Issue 3, 1997, Pages 199-223

  Cichon, E A ^a   Weiermann, A ^a  

^a INRIA   (France)

Author keywords

Boolean pair; Elementary theory; Undecidability; 0 sets

Indexed keywords

EID: 0031566883     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(96)00015-2     Document Type: Article

References (33)

1. [1] P. Aczel, Another elementary treatment of Girard's result connecting the slow and fast growing hierarchies of number-theoretic functions, manuscript, 1980.
2. [2] A. Beckmann and A. Weiermann, A term rewriting characterization of polytime and related complexity classes, preprint, Münster 1995. Arch. Math. Logic, to appear.
3. [3] W. Buchholz, Three contributions to the conference on Recent Advances in Proof Theory, manuscript, 1980.
4. [4] E.A. Cichon, Subrecursive hierarchies and ordinals, Ph.D. Thesis, Leeds University, 1986.
5. [5] E.A. Cichon, Termination proofs and complexity characterisations, in: P. Aczel, H. Simmons, S. Wainer, eds., Proof Theory (Cambridge Univ. Press, Cambridge, 1992) 173-193.
6. [6] E.A. Cichon and S.S. Wainer, The slow-growing and the Grzegorczyk hierarchies, J. Symbolic Logic (48) (1983) 399-408.
7. [7] E.A. Cichon and A. Weiermann, A termination ordering for primitive recursive schemata, preprint, Nancy and Münster, 1995, submitted.
8. [8] N. Dershowitz and J.P. Jouannaud, Rewrite systems, Handbook of Theoretical Computer Science.
9. [9] S. Feferman, Logics for Termination and Correctness of Functional programs, II. Logics of strength PA, in: P. Aczel, H. Simmons, S. Wainer, eds., Proof Theory (Cambridge Univ. Press, Cambridge 1992) 197-225.
10. [10] W. Felscher, Berechenbarkeit: Rekursive und Programmierbare Funktionen (Springer, Bertin, 1993).
11. 2 Logic, Part 1, Ann. Math. Logic (21) (1981) 75-219.
12. [12] A. Grzegorczyk, Some Classes of Recursive Functions, Rozprawy Matematyczne, 4 (1953).
13. [13] W.G. Handley and S.S. Wainer, Equational derivation vs. computation, Ann. Pure Appl. Logic 70 (1994) 17-49.
14. [14] D. Hofbauer, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Proc. 2nd ALP, Lecture Notes in Computer Science, Vol. 463 (Springer, Berlin, 1990) 347-358.
15. [15] H.R. Jervell, Homogeneous Trees, Lecture Notes at the University of Munich, 1979.
16. [16] M. Möllerfeld and A. Weiermann, A uniform approach to ≺ recursion, preprint, Münster (1995), submitted.
17. [17] C. Parsons, On a number-theoretic choice schema and its relation to induction. in: Myhill et al., eds., Intuitionism and Proof Theory (North-Holland, Amsterdam, 1970) 459-473.
18. [18] R. Péter, Recursive Functions (Academic Press, New York, 1967).
19. [19] D.M. Ritchie, Program structure and computational complexity, Doctoral Dissertation, Harvard University, 1968.
20. [20] H.E. Rose, Subrecursion: Functions and Hierarchies (Clarendon Press, Oxford, 1984).
21. [21] U.R. Schmerl, Number theory and the Bachmann Howard ordinal, in: J. Stern, ed., Proc. Herbrand Symp. Logic Colloquium, Vol. 81. (North-Holland, Amsterdam, 1982).
22. [22] K. Schütte, Primitiv-rekursive Ordinalzahlfunktionen, Sitzungsberichte der Bayerischen Akademie der Wissenschaften, Mathematisch Naturwissenschaftliche Klasse 1975 (1976) 143-153.
23. [23] K. Schütte, Proof Theory (Springer, Berlin, 1977).
24. [24] H. Schwichtenberg, Homogeneous trees and subrecursive hierarchies, Lecture at the conference "Recent advances in proof theory", Oxford 1980.
25. [25] W. Sieg, Herbrand analyses, Arch. Math. Logic 30 (1991) 409-441.
26. [26] H. Simmons, The realm of primitive recursion, Arch. Math. Logic 27 (1988).
27. [27] S.S. Wainer, Slow-growing vs. fast-growing, J. Symbolic Logic 54 (1989) 608-614.
28. [28] A. Weiermann, Bounding derivation lengths with functions from the slow growing hierarchy, preprint, Münster, 1993.
29. [29] A. Weiermann, Ein Beitrag zur Theorie der subrekursiven Funktionen, Habilitationsschrift, Münster, 1994.
30. [30] A. Weiermann, Investigations on slow versus fast growing, part I: How to majorize slow growing functions nontrivially by fast growing ones, Arch. for Math. Logic 34 (1995) 313-330.
31. [31] A. Weiermann, Termination proofs for term rewriting systems by lexicographic path orderings yield multiply recursive derivation lengths, Theoret. Comput. Sci. 139 (1995) 355-362.
32. [32] A. Weiermann, Rewriting theory for the Hydra battle and the extended Grzegorczyk hierarchy, J. Symbolic Logic, to appear.
33. [33] A. Weiermann, A strongly uniform termination proof by methods from local predicativity, Archive for Mathematical Logic, to appear.