arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.02387cs.LOmath.LO
收藏

最小集合计算理论中的适用数学

Applicable Mathematics in a Minimal Computational Theory of Sets

Arnon Avron, Liron Cohen

AI总结:

该论文改进了一个静态逻辑框架以支持定义扩展,并证明其中最小可预测理论(证明无限集存在)是计算性的,且足以发展大部分适用数学,将实数视为真类。

摘要:

在之前关于该项目的论文中,我们提出了一个通用的静态逻辑框架,用于形式化和机械化不同强度的集合理论,并探讨了该框架中一些可预测可接受理论的能力。在本工作中,我们首先改进该框架,通过增加通过定义一致地扩展其理论的手段,而不破坏其静态性质或违反其基于的任何原则。然后,我们在改进后的框架内研究其中最小(可预测可接受)理论的能力,该理论证明了无限集的存在性。我们证明该理论是一个计算理论,即其最小传递模型的每个元素都由其某个闭项表示。(该模型恰好是Jensen层级中的第二个宇宙。)然后我们证明,这个最小理论已经足以发展科学适用数学的很大一部分(如果不是全部)。这需要将实数集合视为一个真类,即:一个一元谓词,可以通过论文第一部分描述的静态扩展方法在理论中引入。

英文摘要:

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored. In this work we first improve that framework by enriching it with means for coherently extending by definitions its theories, without destroying its static nature or violating any of the principles on which it is based. Then we turn to investigate within the enriched framework the power of the minimal (predicatively acceptable) theory in it that proves the existence of infinite sets. We show that that theory is a computational theory, in the sense that every element of its minimal transitive model is denoted by some of its closed terms. (That model happens to be the second universe in Jensen's hierarchy.) Then we show that already this minimal theory suffices for developing very large portions (if not all) of scientifically applicable mathematics. This requires treating the collection of real numbers as a proper class, that is: a unary predicate which can be introduced in the theory by the static extension method described in the first part of the paper.

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

↑