arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.07277cs.LO
收藏

条形递归不能通过迭代计算

Bar recursion is not computable via iteration

John Longley

摘要:

我们表明,酒吧递归运营商的斯佩克特和Kohlenbach,被认为是三阶泛函作用于总参数,是不可计算的哥德尔的系统T加最小化,我们证明是相当于一个程序设计语言与高阶迭代结构。主要结果是制定,以暗示在T + min内的各种部分和总的模型,例如Kleene-Kreisel连续泛函酒吧递归的不可定义性。因此,本文提供证明书中所述的一些结果由朗利和诺曼。主要定理的证明认真使用嵌套顺序过程(也称为PCF Boehm树)的理论,并通过表明bar递归不能由任何顺序过程表示,其中嵌套函数应用程序的树是有根据的。

英文摘要:

We show that the bar recursion operators of Spector and Kohlenbach, considered as third-order functionals acting on total arguments, are not computable in Goedel's System T plus minimization, which we show to be equivalent to a programming language with a higher-order iteration construct. The main result is formulated so as to imply the non-definability of bar recursion in T + min within a variety of partial and total models, for instance the Kleene-Kreisel continuous functionals. The paper thus supplies proofs of some results stated in the book by Longley and Normann. The proof of the main theorem makes serious use of the theory of nested sequential procedures (also known as PCF Boehm trees), and proceeds by showing that bar recursion cannot be represented by any sequential procedure within which the tree of nested function applications is well-founded.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑