...
首页> 外文期刊>Lithuanian mathematical journal >Loop-free calculus for modal logic S4. II
【24h】

Loop-free calculus for modal logic S4. II

机译:模态逻辑S4的无环演算。 II

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

摘要

In [J. Andrikonis, Loop-free calculus for modal logic S4. I, Lith. Math. J., 52(1):1-12, 2012], loop-free calculus for modal logic S4 is presented. The calculus uses several types of indexes to avoid loops and obtain termination of derivation search. Although the mentioned article proves that derivation search in the calculus is finite, the proof of soundness and completeness is omitted and, therefore, is presented in this paper. Moreover, this paper presents loop-free calculus for modal logics K4, which is obtained by modifying the calculus for S4. Finally, some remarks for programming the given calculi are offered.
机译:在[J. Andrikonis,模态逻辑S4的无环演算。我,莉丝。数学。 J.,52(1):1-12,2012],提出了模态逻辑S4的无环演算。演算使用几种类型的索引来避免循环并获得派生搜索的终止。尽管所提到的文章证明了演算中的推导搜索是有限的,但省略了稳健性和完整性的证明,因此在本文中进行了介绍。此外,本文介绍了模态逻辑K4的无环演算,它是通过修改S4的演算获得的。最后,提供了一些编程给定结石的说明。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号