A Simplified Characterisation of Provably Computable Functions of the System ID₁ of Inductive Definitions
From MaRDI portal
Publication:6232958
arXiv1205.2879MaRDI QIDQ6232958FDOQ6232958
Authors: Naohi Eguchi, Andreas Weiermann 
Publication date: 13 May 2012
Abstract: 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.
This page was built for publication: A Simplified Characterisation of Provably Computable Functions of the System ID_1 of Inductive Definitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232958)
