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

构造性类型论中Tennenbaum定理的分析

An Analysis of Tennenbaum's Theorem in Constructive Type Theory

Marc Hermes, Dominik Kirst

AI总结:

本文在构造性类型论框架下重新分析并推广Tennenbaum定理,通过Church论题内部化可计算性论证,构造化多个经典证明并给出内在构造性表述,揭示经典视角下不可见的假设与结论差异,并完成Coq机械化。

摘要:

Tennenbaum定理指出,具有可计算算术运算的Peano算术(PA)的唯一可数模型是自然数的标准模型。在本文中,我们以构造性类型论为框架,重新审视、分析并推广这一结果。所选框架允许采用综合性的可计算性理论方法,利用这样一个事实:从外部看,构造性类型论中可定义的所有函数都可以被证明是可计算的。我们基于这一观点,进一步通过假设Church论题的一个版本来将其内部化,该版本表明自然数上的任何函数都可由PA中的一个公式表示。这一假设为开展严格的可计算性论证提供了便利且抽象的设置,即使在定理的机械化中也是如此。具体而言,我们将若干经典证明构造化,并给出Tennenbaum定理的一个内在构造性表述,所有这些都遵循文献中的论证。特别是就经典证明而言,构造性设置使我们能够凸显它们在假设和结论上的差异,而这些差异在经典视角下是不可见的。所有版本都配有Coq证明助手中的统一机械化。

英文摘要:

Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper, we use constructive type theory as a framework to revisit, analyze and generalize this result. The chosen framework allows for a synthetic approach to computability theory, exploiting that, externally, all functions definable in constructive type theory can be shown computable. We then build on this viewpoint, and furthermore internalize it by assuming a version of Church's thesis, which expresses that any function on natural numbers is representable by a formula in PA. This assumption provides for a conveniently abstract setup to carry out rigorous computability arguments, even in the theorem's mechanization. Concretely, we constructivize several classical proofs and present one inherently constructive rendering of Tennenbaum's theorem, all following arguments from the literature. Concerning the classical proofs in particular, the constructive setting allows us to highlight differences in their assumptions and conclusions which are not visible classically. All versions are accompanied by a unified mechanization in the Coq proof assistant.

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

↑