Abstract
Complexity classes between Grzegorczyk’s E 2 and E 3 are characterized in terms of provable recursion in a theory EA(I;O) formalising basic principles of Nelson’s Predicative Arithmetic. Extensions by inductive definitions enable full arithmetic PA and higher systems to be recaptured in a setting where the natural bounding functions are “slow” rather than “fast” growing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellantoni, S., Cook, S.: A new recursion theoretic characterization of the polytime functions. Computational Complexity 2, 97–110 (1992)
Buchholz, W.: An independence result for \(\Pi^1_1\)–CA + BI. Annals of Pure and Applied Logic 23, 131–155 (1987)
Leivant, D.: Intrinsic theories and computational complexity. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 177–194. Springer, Heidelberg (1995)
Nelson, E.: Predicative arithmetic. Princeton (1986)
Ostrin, G.E., Wainer, S.S.: Proof theoretic complexity. In: Schwichtenberg, H., Steinbrüggen, R. (eds.) Proof and System Reliability, pp. 369–397. Kluwer, Dordrecht (2002)
Wainer, S.S., Williams, R.S.: Inductive definitions over a predicative arithmetic. Annals of Pure and Applied Logic (to appear)
Williams, R.S.: Finitely iterated inductive definitions over a predicative arithmetic, Ph.D. thesis, Leeds (2004)
Wirz, M.: Wellordering two sorts. preliminary report, Bern (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ostrin, G.E., Wainer, S.S. (2005). Complexity in Predicative Arithmetic. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_47
Download citation
DOI: https://doi.org/10.1007/11494645_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)