Rooted Hypersequent Calculus for Modal Logic S5

被引：0
|
作者：
Hamzeh Mohammadi
Mojtaba Aghaei
机构：
[1] Isfahan University of Technology,Department of Mathematical Sciences
来源：
Logica Universalis | 2023年 / 17卷
关键词：
Proof theory; Hypersequent calculus; Cut-elimination; Modal logic S5; Primary 03F03; Secondary 03F05; 03B45;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present a rooted hypersequent calculus for modal propositional logic S5. We show that all rules of this calculus are invertible and that the rules of weakening, contraction, and cut are admissible. Soundness and completeness are established as well.
引用
收藏
页码：269 / 295
页数：26
相关论文
共 50 条
  • [21] Destructive Extension Rule in Propositional Modal Logic S5 System
    Ma, Li Zheng
    Tan, Xi
    Huang, Pei
    Bai, Li
    Wu, Zi Yan
    [J]. MANUFACTURING, DESIGN SCIENCE AND INFORMATION ENGINEERING, VOLS I AND II, 2015, : 1249 - 1255
  • [22] A Henkin-Style Completeness Proof for the Modal Logic S5
    Bentzen, Bruno
    [J]. LOGIC AND ARGUMENTATION, CLAR 2021, 2021, 13040 : 459 - 467
  • [23] A Hypersequent Calculus with Clusters for Data Logic over Ordinals
    Lick, Anthony
    [J]. AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, TABLEAUX 2019, 2019, 11714 : 166 - 184
  • [24] Finite Topological Models of Modal Logic Systems S4 and S5
    Li, Cao-lin
    Xu, Luo-shan
    [J]. QUANTITATIVE LOGIC AND SOFT COMPUTING 2010, VOL 2, 2010, 82 : 311 - 319
  • [25] Improved Destructive Extension Rule in Propositional Modal Logic S5 System
    Huang, Pei
    Yang, YuTing
    Tan, Xi
    Gao, Yuan
    [J]. 2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING APPLICATIONS (CSEA 2015), 2015, : 38 - 42
  • [26] Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring
    Huang, Pei
    Liu, Minghao
    Wang, Ping
    Zhang, Wenhui
    Ma, Feifei
    Zhang, Jian
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 1093 - 1100
  • [27] Modal Logic S5 in Answer Set Programming with Lazy Creation of Worlds
    Alviano, Mario
    Batsakis, Sotiris
    Baryannis, George
    [J]. LOGIC PROGRAMMING AND NONMONOTONIC REASONING, LPNMR 2022, 2022, 13416 : 16 - 28
  • [28] Modal Combinatorialism is Consistent with S5
    Taylor, Henry
    [J]. THOUGHT-A JOURNAL OF PHILOSOPHY, 2019, 8 (01): : 23 - 32
  • [29] CUT-FREE GENTZEN-TYPE SYSTEM FOR THE MODAL LOGIC S5
    SATO, M
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1980, 45 (01) : 67 - 84
  • [30] Two Is Enough - Bisequent Calculus for S5
    Indrzejczak, Andrzej
    [J]. FRONTIERS OF COMBINING SYSTEMS (FROCOS 2019), 2019, 11715 : 277 - 294
12345