A term rewriting characterization of the functions computable in polynomial space

Archive for Mathematical Logic

Volumn 41, Issue 1, 2002, Pages 35-47

  Oitavem, Isabel ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036002293     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530200002     Document Type: Article

References (7)

1. Beckmann, A., Weiermann, A.: A term rewriting characterization of the polytime functions and related complexity classes, Arch. Math. Logic., 36, 11-30 (1996)
2. Bellantoni, S., Cook, S.: A New Recursion-Theoretic Characterization of Polytime Functions, Computational Complexity, 2, 97-110 (1992)
3. Bellantoni, S.: Predicative Recursion and the Polytime Hierarchy, Feasible Mathematics II, ed. P.Clote and J.B.Remmel, 15-29 (1995)
4. Cichon, E.A., Weiermann A.: Term rewriting theory for the primitive recursive functions, Annals of Pure and Applied Logic., 83, 199-223 (1997)
5. Dershowitz, N., Jouannaud J.P.: Rewriting systems, Handbook of Theoretical Computer Science B: Formal Methods and Semantics, ed. by van Leeuwen J., Amsterdam: North-Holland, 243-320 (1990)
6. Oitavem, I.: Três assuntos de Lógica e Complexidade, Tese de Mestrado, Universidade de Lisboa, (1995)
7. Oitavem, I.: New recursive characterizations of the elementary functions and the functions computable in polynomial space, Revista Matematica de la Universidad Complutense de Madrid, 10(1), 109-125 (1997)