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

可计算性理论、非标准分析及其联系

Computability Theory, Nonstandard Analysis, and their connections

Dag Normann, Sam Sanders

摘要:

我们研究可计算性理论和非标准分析之间的联系。特别是,我们调查了以下两个主题,并表明它们是密切相关的。(T.1)Cantor空间$2^{\mathbb{N}}$的一个基本性质是Heine-Borel紧性:对于$2^{\mathbb{N}}$的任何开覆盖,存在有限子覆盖。一个自然的问题是:计算这样一个有限的子覆盖有多难?我们通过分析泛函的复杂性使其精确,给定任何$g:2^{\mathbb{N}}\rightarrow \mathbb{N}$,在$2^{\mathbb{N}}$中输出有限序列$\langle f_0 , \dots, f_n\rangle $,使得从$\bar{f_i}g(f_i)$为$i\leq n$定义的邻域形成Cantor空间的覆盖。(T.2)康托空间在非标准分析中的一个基本性质是亚伯拉罕·罗宾逊的非标准紧性,即每个二元序列都“无限接近"标准二元序列。我们分析了康托空间的这种非标准紧性的强度,与非标准分析和通常数学的其他公理进行了比较。对(T.1)的研究在可计算性理论中产生了奇异对象,而对(T.2)的研究在逆向数学中产生了令人惊讶的结果。我们强调,(T.1)和(T.2)是高度交织在一起的,我们对这些主题的研究本质上是“整体性的”:可计算性理论的结果引起非标准分析的结果,反之亦然。

英文摘要:

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$ is Heine-Borel compactness: For any open cover of $2^{\mathbb{N}}$, there is a finite sub-cover. A natural question is: How hard is it to compute such a finite sub-cover? We make this precise by analyzing the complexity of functionals that given any $g:2^{\mathbb{N}}\rightarrow \mathbb{N}$, output a finite sequence $\langle f_0 , \dots, f_n\rangle $ in $2^{\mathbb{N}}$ such that the neighbourhoods defined from $\bar{f_i}g(f_i)$ for $i\leq n$ form a cover of Cantor space. (T.2) A basic property of Cantor space in Nonstandard Analysis is Abraham Robinson's nonstandard compactness, i.e. that every binary sequence is `infinitely close' to a standard binary sequence. We analyze the strength of this nonstandard compactness property of Cantor space, compared to the other axioms of Nonstandard Analysis and usual mathematics. The study of (T.1) gives rise to exotic objects in computability theory, while (T.2) leads to surprising results in Reverse Mathematics. We stress that (T.1) and (T.2) are highly intertwined and that our study of these topics is `holistic' in nature: results in computability theory give rise to results in Nonstandard Analysis and vice versa.

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

↑