Elementary arithmetic

Citations of this article
Mendeley users who have this article in their library.


There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion [S. Bellantoni, S. Cook, A new recursion theoretic characterization of the polytime functions, Computational Complexity 2 (1992) 97-110] can be imposed on arithmetical theories like PA: quantify over safes and induct on normals. This weakens the theory severely, so that the provably recursive functions become more realistically computable (slow growing rather than fast growing). Earlier results of D. Leivant [Intrinsic theories and computational complexity, in: D. Leivant (Ed.), Logic and Computational Complexity, Lecture Notes in Computer Science, vol. 960, Springer-Verlag, 1995, pp. 177-194] are re-worked and extended in this new context, giving proof-theoretic characterizations (according to the levels of induction used) of complexity classes between Grzegorczyk's E2 and E3. © 2004 Elsevier B.V. All rights reserved.




Ostrin, G. E., & Wainer, S. S. (2005). Elementary arithmetic. Annals of Pure and Applied Logic, 133(1-3 SPEC. ISS.), 275–292. https://doi.org/10.1016/j.apal.2004.10.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free