On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness

In this paper the numerical strength of fragments of arithmetical comprehension, choice and general uniform boundedness is studied systematically. These principles are investigated relative to base systems T ! n in all nite types which are suited to formalize substantial parts of analysis but nevertheless have provably recursive function(al)s of low growth… (More)