A term rewriting characterization of the polytime functions and related complexity classes

Archive for Mathematical Logic

Volumn 36, Issue 1, 1996, Pages 11-30

  Beckmann, Arnold ^a   Weiermann, Andreas ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030300519     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050054     Document Type: Article

References (16)

1. Beckmann, A.: Separating fragments of bounded predicative arithmetic. Dissertation (1996)
2. Beckmann, A., Weiermann, A.: Investigations on subrecursion via logic programming. Preprint, Münster (1995)
3. Bellantoni, S., Cook, S.: A new recursion-theoretic characterisation of the polytime functions. Comput. Complexity 2, No. 2, 97-110 (1992)
4. Bellantoni, S.: Predicative recursion and computational complexity. Dissertation, Toronto (1992)
5. Buss, S.: Bounded arithmetic. Bibliopolis (1986)
6. Cichon, E.A., Weiermann, A.: Term rewriting theory for the primitive recursive functions. Ann. Pure Appl. Logic (to appear)
7. Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science B: Formal Methods and Semantics, pp. 243-320. Amsterdam: North-Holland 1990
8. Handley, W.G., Wainer, S.S.: Equational derivation vs. computation. Ann. Pure Appl. Logic 70, 17-49 (1994)
9. Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. Proc. 2nd ALP. Lecture Notes in Computer Science 463, 347-358 (1990)
10. Leivant, D.: Predicative recurrence in finite type. In: Nerode A., Matiyasevich Y.V. (eds.) Logical Foundations of Computer Science. Springer Lecture Notes in Computer Science 813, 227-239 (1994)
11. Möllerfeld, M., Weiermann, A.: A uniform approach to ≺-recursion. Preprint, Münster (1995) (submitted)
12. Pohlers, W.: Proof theory: An Introduction. Springer Lecture Notes in Mathematics 1407 (1989)
13. Simmons, H.: The realm of primitive recursion. Arch. Math. Logic 27, 177-188 (1988)
14. Weiermann, A.: Termination proofs for term rewriting systems by lexicographic path orderings yield multiply recursive derivation lengths. Theoret. Comput. Sci. 139, 355-362 (1995)
15. Weiermann, A.: Rewriting theory for the Hydra battle and the extended Grzegorczyk hierarchy. Preprint, Nancy and Münster (1995). J. Symb. Logic (to appear)
16. Weiermann, A.: A proof of strongly uniform termination for Gödel's T by methods from local predicativity. Preprint, Münster (1995). Arch. Math. Logic (to appear)