Abstract
Complexity classes between Grzegorczyk's E2 and E3 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. © Springer-Verlag Berlin Heidelberg 2005.
Author supplied keywords
Cite
CITATION STYLE
APA
Ostrin, G. E., & Wainer, S. S. (2005). Complexity in predicative arithmetic. In Lecture Notes in Computer Science (Vol. 3526, pp. 378–384). Springer Verlag. https://doi.org/10.1007/11494645_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free