Complexity in Predicative Arithmetic
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.
Keywordsprovable recursion ordinal analysis slow growing hierarchy
Unable to display preview. Download preview PDF.
- 3.Leivant, D.: Intrinsic theories and computational complexity. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 177–194. Springer, Heidelberg (1995)Google Scholar
- 4.Nelson, E.: Predicative arithmetic. Princeton (1986)Google Scholar
- 5.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)Google Scholar
- 6.Wainer, S.S., Williams, R.S.: Inductive definitions over a predicative arithmetic. Annals of Pure and Applied Logic (to appear)Google Scholar
- 7.Williams, R.S.: Finitely iterated inductive definitions over a predicative arithmetic, Ph.D. thesis, Leeds (2004)Google Scholar
- 8.Wirz, M.: Wellordering two sorts. preliminary report, Bern (2004)Google Scholar