{
  "id": "1205.2879",
  "version": "v1",
  "published": "2012-05-13T16:17:03.000Z",
  "updated": "2012-05-13T16:17:03.000Z",
  "title": "A Simplified Characterisation of Provably Computable Functions of the System ID_1 of Inductive Definitions",
  "authors": [
    "Naohi Eguchi",
    "Andreas Weiermann"
  ],
  "comment": "Technical Report",
  "categories": [
    "math.LO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-05-13T16:17:03.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "provably computable functions",
      "inductive definitions",
      "simplified characterisation",
      "provably total computable functions",
      "peano arithmetic pa"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1205.2879E"
    }
  }
}