arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.01919math.LO
收藏

从非标准分析到各种可计算性理论

From Nonstandard Analysis to various flavours of Computability Theory

Sam Sanders

摘要:

正如标题所暗示的那样,最近已经很清楚,非标准分析(NSA)的定理引起了可计算性理论中的定理(不再涉及NSA)。现在,上述学科分为经典和高阶可计算性理论,其中前者(分别)。后者)子规程处理类型0和类型1(分别为0和1)的对象。所有类型)。上述结果关于国家安全局专门处理高阶情况下,我们在本文中表明,定理的国家安全局也产生了定理在经典的可计算性理论考虑所谓的教科书证明。

英文摘要:

As suggested by the title, it has recently become clear that theorems of Nonstandard Analysis (NSA) give rise to theorems in computability theory (no longer involving NSA). Now, the aforementioned discipline divides into classical and higher-order computability theory, where the former (resp. the latter) sub-discipline deals with objects of type zero and one (resp. of all types). The aforementioned results regarding NSA deal exclusively with the higher-order case; we show in this paper that theorems of NSA also give rise to theorems in classical computability theory by considering so-called textbook proofs.

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

↑