A Simplified Characterisation of Provably Computable Functions of the System ID$_1$ of Inductive Definitions : Extended Abstract (Proof theory and complexity)
Naohi Eguchi, Andreas Weiermann · Institutional Repositories DataBase (IRDB) · 2013
We present a simplified and streamlined characterisation of provably total computable functions of the system $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 streamlined characterisation of provably total computable functions of Peano arithmetic $PA.$