Embedding the hypersequent calculus in the display calculus

被引:9
|
作者
Ramanayake, Revantha [1 ]
机构
[1] Vienna Univ Technol, Inst Comp Languages, A-1020 Vienna, Austria
基金
奥地利科学基金会;
关键词
Display calculus; hypersequent; proof-theory; notational variant; LOGIC;
D O I
10.1093/logcom/exu061
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The difficulty in finding analytic Gentzen sequent calculi for non-classical logics has lead to the development of many new proof frameworks (proof systems) that have been used to give analytic calculi for these logics. The multitude and diversity of such frameworks has made it increasingly important to identify their interrelationships and relative expressive power. Hypersequent and Display calculi are two widely-used proof frameworks employed to present analytic calculi for large classes of logics. In this article, we show how any hypersequent calculus can be used to construct a display calculus for the same logic. The display calculus we obtain preserves proof-theoretic properties of the original calculus including cut-elimination and the subformula property. Since the construction applies to any hypersequent calculus, this result shows that in terms of presenting logics the display calculus formalism subsumes the hypersequent calculus formalism.
引用
收藏
页码:921 / 942
页数:22
相关论文
共 50 条
  • [1] Hypersequent calculus for intuitionistic logic with classical atoms
    Kurokawa, Hidenori
    [J]. LOGICAL FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, 4514 : 318 - 331
  • [2] Intermediate Logics Admitting a Structural Hypersequent Calculus
    Lauridsen, Frederik M.
    [J]. STUDIA LOGICA, 2019, 107 (02) : 247 - 282
  • [3] Intermediate Logics Admitting a Structural Hypersequent Calculus
    Frederik M. Lauridsen
    [J]. Studia Logica, 2019, 107 : 247 - 282
  • [4] 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
  • [5] ON A MULTILATTICE ANALOGUE OF A HYPERSEQUENT S5 CALCULUS
    Grigoriev, Oleg
    Petrukhin, Yaroslav
    [J]. LOGIC AND LOGICAL PHILOSOPHY, 2019, 28 (04) : 683 - 730
  • [6] Embedding calculus for surfaces
    Rannich, Anuel
    Upers, Lexander
    [J]. ALGEBRAIC AND GEOMETRIC TOPOLOGY, 2024, 24 (02):
  • [7] Rooted Hypersequent Calculus for Modal Logic S5
    Hamzeh Mohammadi
    Mojtaba Aghaei
    [J]. Logica Universalis, 2023, 17 : 269 - 295
  • [8] Rooted Hypersequent Calculus for Modal Logic S5
    Mohammadi, Hamzeh
    Aghaei, Mojtaba
    [J]. LOGICA UNIVERSALIS, 2023, 17 (03) : 269 - 295
  • [9] CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
    Indrzejczak, Andrzej
    [J]. REVIEW OF SYMBOLIC LOGIC, 2019, 12 (04): : 806 - 822
  • [10] Embedding the refinement calculus in Coq
    Alpuim, Joao
    Swierstra, Wouter
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 2018, 164 : 37 - 48