Complexity in Predicative Arithmetic

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access

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.