首页> 外文期刊>Journal of logic and computation >Sahlqvist theory for impossible worlds
【24h】

Sahlqvist theory for impossible worlds

机译:萨尔奎斯特的不可能世界理论

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

摘要

We extend unified correspondence theory to Kripke frames with impossible worlds and their associated regular modal logics. These are logics the modal connectives of which are not required to be normal: only the weaker properties of additivityx.y=(x. y) and multiplicativityx.y=(x. y) are required. Conceptually, it has been argued that their lacking necessitation makes regular modal logics better suited than normal modal logics at the formalization of epistemic and deontic settings. From a technical viewpoint, regularity proves to be very natural and adequate for the treatment of algebraic canonicity Jonsson- style. Indeed, additivity and multiplicativity turn out to be key to extend Jonsson's original proof of canonicity to the full Sahlqvist class of certain regular distributive modal logics naturally generalizing distributive modal logic. Most interestingly, additivity and multiplicativity are key to Jonsson- style canonicity also in the original (i. e. normal) DML. Our contributions include: the definition of Sahlqvist inequalities for regular modal logics on a distributive lattice propositional base; the proof of their canonicity following Jonsson's strategy; the adaptation of the algorithm ALBA to the setting of regular modal logics on two non- classical (distributive lattice and intuitionistic) bases; the proof that the adapted ALBA is guaranteed to succeed on a syntactically defined class which properly includes the Sahlqvist one; finally, the application of the previous results so as to obtain proofs, alternative to Kripke's, of the strong completeness of Lemmon's epistemic logics E2- E5 with respect to elementary classes of Kripke frames with impossible worlds.
机译:我们将统一对应理论扩展到具有不可能世界的Kripke框架及其关联的规则模态逻辑。这些是模态连接词不要求是正常的逻辑:仅需要可加性x.y =(x。y)和乘法性x.y =(x。y)的较弱属性。从概念上讲,在认识论和道义论式的形式化上,它们的缺乏使常规模态逻辑比普通模态逻辑更适合。从技术角度来看,规律性被证明是自然而然的,足以处理代数规范性Jonsson-style。确实,加性和乘法性是将Jonsson原始正则性证明扩展到某些常规分布模态逻辑的完整Sahlqvist类的自然关键,这些规则自然会概括分布模态逻辑。最有趣的是,在原始的(即正常的)DML中,加性和乘法性也是强森式规范性的关键。我们的贡献包括:基于分布格命题基础的规则模态逻辑的Sahlqvist不等式的定义;遵循Jonsson的策略证明他们的正直性;在两个非经典(分布格和直觉)的基础上,将算法ALBA适应常规模态逻辑的设置;证明经过改编的ALBA可以在语法定义的类(包括Sahlqvist的类)上成功获得证明;最后,使用先前的结果来获得证明,以替代Kripke的方法来证明Lemmon的认知逻辑E2- E5关于具有不可能世界的Kripke框架的基本分类的强完整性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号