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

经典可实现性与算术公式

Classical realizability and arithmetical formulæ

Mauricio Guillermo, Étienne Miquey

摘要:

本文讨论了经典可实现性(如[20]中定义的)在算术公式情形下的具体化问题。在[10]和[11]的连续性中,我们将公式的通用实现子刻画为博弈的获胜策略(根据公式定义)。在第一节中,我们回顾了经典可实现性的定义,以及一些技术结果。在第5节中,我们将更详细地介绍指定问题和我们稍后采用的博弈论观点的直观性。我们首先提出了一个游戏$G_1$,我们证明是足够的和完整的,如果语言不包含指令“报价”[18],使用交互常数做替代执行线程。然后,我们表明,只要语言包含“报价”,游戏是没有更完整的,并提出了第二个游戏${G}_2$,这是充分和完整的一般情况下。在最后一节,我们提请注意模型理论的观点,并使用我们的规格结果表明,算术公式是绝对的可实现性模型。

英文摘要:

In this paper we treat the specification problem in classical realizability (as defined in [20]) in the case of arithmetical formulæ. In the continuity of [10] and [11], we characterize the universal realizers of a formula as being the winning strategies for a game (defined according to the formula). In the first section we recall the definition of classical realizability, as well as a few technical results. In Section 5, we introduce in more details the specification problem and the intuition of the game-theoretic point of view we adopt later. We first present a game $G_1$, that we prove to be adequate and complete if the language contains no instructions "quote" [18], using interaction constants to do substitution over execution threads. Then we show that as soon as the language contain "quote", the game is no more complete, and present a second game ${G}_2$ that is both adequate and complete in the general case. In the last Section, we draw attention to a model-theoretic point of view, and use our specification result to show that arithmetical formulæ are absolute for realizability models.

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

↑