A Simplified Characterisation of Provably Computable Functions of the System ID₁ of Inductive Definitions
classification
🧮 math.LO
keywords
characterisationcomputablefunctionsprovablydefinitionsinductivesimplifiedtotal
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.