Abstract.
We give a term rewriting characterization of the polyspace functions. Our work follows investigations on term rewriting characterizations of some classes of (sub-) recursive functions as initiated by Cichon and Weiermann [4] and continued by Beckmann and Weiermann [1].
The main novelty of this paper is a technique for reformulating recursion schemes. The aim of this technique is to provide rewriting rules which give rise to rewriting chains whose terms are suitably bounded. This bounding is crucial when dealing with computational classes with space constraints.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 14 December 1998 / Published online: 12 December 2001
Rights and permissions
About this article
Cite this article
Oitavem, I. A term rewriting characterization of the functions computable in polynomial space. Arch. Math. Logic 41, 35–47 (2002). https://doi.org/10.1007/s001530200002
Issue Date:
DOI: https://doi.org/10.1007/s001530200002