...
首页> 外文期刊>Annals of Pure and Applied Logic >Self-referentiality of Brouwer-Heyting-Kolmogorov semantics
【24h】

Self-referentiality of Brouwer-Heyting-Kolmogorov semantics

机译:Brouwer-Heyting-Kolmogorov语义的自指称

获取原文
获取原文并翻译 | 示例
           

摘要

The G?del-Artemov framework offered a formalization of the Brouwer-Heyting-Kolmogorov (BHK) semantics of intuitionistic logic via classical proofs. In this framework, the intuitionistic propositional logic IPC is embedded in the modal logic S4, S4 is realized in the Logic of Proofs LP, and LP has a provability interpretation in Peano Arithmetic. Self-referential LP-formulas of the type 't is a proof of a formula φ containing t itself' are permitted in the realization of S4 in LP, and if such formulas are indeed involved, it is then necessary to use fixed-point arithmetical methods to explain intuitionistic logic via provability. The natural question of whether self-referentiality can be avoided in realization of S4 was answered negatively by Kuznets who provided an S4-theorem that cannot be realized without using directly self-referential LP-formulas. This paper studies the question of whether IPC can be embedded in S4 and then realized in LP without using self-referential formulas. We consider a general class of G?del-style modal embeddings of IPC in S4 and by extending Kuznets' method, show that there are IPC-theorems such that, under each such embedding, are mapped to S4-theorems that cannot be realized in LP without using directly self-referential formulas. Interestingly, all double-negations of tautologies that are not IPC-theorems, like (p→p), are shown to require direct self-referentiality. Another example is found in IPC→, the purely implicational fragment of IPC. This suggests that the BHK semantics of intuitionistic logic (even of intuitionistic implication) is intrinsically self-referential.This paper is an extended version of [26].
机译:G?del-Artemov框架通过经典证明提供了直觉逻辑的Brouwer-Heyting-Kolmogorov(BHK)语义的形式化。在此框架中,直觉命题逻辑IPC嵌入在模态逻辑S4中,S4在证明逻辑LP中实现,而LP在Peano算法中具有可证明性解释。在LP中实现S4时,允许使用类型为“ t的自引用LP公式来证明包含t本身的公式φ”,并且如果确实包含此类公式,则必须使用定点算术通过可证明性解释直觉逻辑的方法。库兹涅茨否定了一个自然问题,即在实现S4时是否可以避免自指代性,库兹涅茨提供了一个S4定理,如果不直接使用自指称LP公式就无法实现这一定理。本文研究了是否可以在不使用自引用公式的情况下将IPC嵌入到S4中然后在LP中实现的问题。我们考虑了S4中IPC的G?del样式模态嵌入的一般类,并且通过扩展Kuznets的方法,表明存在IPC定理,使得在每个这样的嵌入下,IPC定理都映射到S4定理,而在LP不使用直接自指公式。有趣的是,所有并非IPC定理的重言式双重否定,如(p→p),都被证明需要直接的自我指称。在IPC的纯暗示性片段IPC→中找到了另一个示例。这表明直觉逻辑的BHK语义(甚至是直觉蕴涵)在本质上是自指的。本文是[26]的扩展版本。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号