SLR is PTIME-Complete
Download:
|
|
by A. S. Murawski, C. -h. L. Ong
ftp://ftp.comlab.ox.ac.uk/pub/Documents/techpapers/Luke.Ong/slr.ps.gz
Add To MetaCart
Abstract:
SLR is obtained from Hofmann's SLR (see e.g. [2]) by removing the axiom (S-AX). In this note we show that every unary numeric function in PTIME is the (standard set-theoretic) interpretation of some SLR term of type 2N! N. 1 The type theory SLR SLR is obtained from Hofmann's SLR (see e.g. [2]) by removing the axiom (S-Ax), hence we need only consider two kinds of function space, namely, A ( B and 2A! B, called anelinear or simply linear (corresponding to safe argument) and modal (corresponding to normal argument) respectively. Bellantoni-Cook safe recursion [1] is available in SLR in the form of a constant rec
Citations
| 146 | A new recursion-theoretic characterization of the poly-time functions – Bellantoni, Cook - 1992 |
| 26 | A foundational delineation of poly-time – Leivant - 1994 |
| 17 | Safe recursion with higher types and BCK-algebra – Hofmann |
