归纳定义系统ID_1的可证计算函数的简化刻画
A Simplified Characterisation of Provably Computable Functions of the System ID_1 of Inductive Definitions
摘要:
我们提出了一个简化和流线型的可证明的全部可计算功能的理论ID_1的非迭代归纳定义的特征。的想法是简化采用的方法,运营商控制的衍生工具,最初介绍了由Wilfried Buchholz和后来申请的第二作者的一个特征证明总可计算功能的皮亚诺算术PA。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。