arXiv Analytics

Sign in

arXiv:1205.2879 [math.LO]AbstractReferencesReviewsResources

A Simplified Characterisation of Provably Computable Functions of the System ID_1 of Inductive Definitions

Naohi Eguchi, Andreas Weiermann

Published 2012-05-13Version 1

We present a simplified and streamlined characterisation of provably total computable functions of the theory ID_1 of non-iterated inductive definitions. The idea of the simplification is to employ the method of operator-controlled derivations that was originally introduced by Wilfried Buchholz and afterwards applied by the second author to a characterisation of provably total computable functions of Peano arithmetic PA.

Comments: Technical Report
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:1306.5559 [math.LO] (Published 2013-06-24, updated 2014-01-20)
Characterising Complexity Classes by Inductive Definitions in Bounded Arithmetic
arXiv:1405.2558 [math.LO] (Published 2014-05-11)
On a Hierarchy of Reflection Principles in Peano Arithmetic
arXiv:1902.07404 [math.LO] (Published 2019-02-20)
The Provability of Consistency

Links

Toolbox