首页> 外文期刊>Theory of computing systems >Self-Referential Justifications in Epistemic Logic
【24h】

Self-Referential Justifications in Epistemic Logic

机译:认知逻辑中的自指称理由

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

摘要

This paper is devoted to the study of self-referential proofs and/or justifications, i.e., valid proofs that prove statements about these same proofs. The goal is to investigate whether such self-referential justifications are present in the reasoning described by standard modal epistemic logics such as S4. We argue that the modal language by itself is too coarse to capture this concept of self-referentiality and that the language of justification logic can serve as an adequate refinement. We consider well-known modal logics of knowledge/belief and show, using explicit justifications, that S4, D4, K4, and T with their respective justification counterparts LP, JD4, J4, and JT describe knowledge that is self-referential in some strong sense. We also demonstrate that self-referentiality can be avoided for K and D.rnIn order to prove the former result, we develop a machinery of minimal evidence functions used to effectively build models for justification logics. We observe that the calculus used to construct the minimal functions axiomatizes the reflected fragments of justification logics. We also discuss difficulties that result from an introduction of negative introspection.
机译:本文致力于研究自我指称证明和/或证明,即证明有关这些相同证明的陈述的有效证明。目的是研究在诸如S4之类的标准模式认知逻辑所描述的推理中是否存在这种自我指称的理由。我们认为,模态语言本身过于粗糙,无法捕捉到这种自我指称的概念,并且证明逻辑的语言可以作为适当的提炼。我们考虑了众所周知的知识/信念的模态逻辑,并使用显式的证明,表明S4,D4,K4和T以及它们各自的证明对应物LP,JD4,J4和JT描述了在某些情况下具有自指称性的知识感。我们还证明了可以避免K和D.rn的自指代。为了证明前一个结果,我们开发了一种最小证据功能的机制,用于有效地建立对正逻辑的模型。我们观察到,用于构造最小函数的演算公理化了证明逻辑的反映片段。我们还讨论了引入负面内省带来的困难。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号