Cut-Free Gentzen Sequent Calculi for Tense Logics

被引:0
|
作者
Lin, Zhe [1 ]
Ma, Minghui [2 ]
机构
[1] Xiamen Univ, Dept Philosophy, Xiamen 361000, Peoples R China
[2] Sun Yat Sen Univ, Inst Logic & Cognit, Dept Philosophy, Guangzhou 510275, Peoples R China
关键词
proof theory; tense logic; sequent calculus; cut elimination;
D O I
10.3390/axioms12070620
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The cut-free single-succedent Gentzen sequent calculus GKt for the minimal tense logic K-t is introduced. This sequent calculus satisfies the displaying property. The proof proceeds in terms of a Kolmogorov translation and three intermediate sequent systems. Finally, we show that tense logics axiomatized by strictly positive implication have cut-free Gentzen sequent calculi uniformly.
引用
收藏
页数:19
相关论文
共 50 条
  • [1] Modular Construction of Cut-Free Sequent Calculi for Paraconsistent Logics
    Avron, Arnon
    Konikowska, Beata
    Zamansky, Anna
    [J]. 2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2012, : 85 - 94
  • [2] Cut-free sequent calculi for logics characterized by finite linear Kripke frames
    Matsuda, Naosuke
    [J]. LOGIC JOURNAL OF THE IGPL, 2017, 25 (05) : 686 - 696
  • [3] Cut-Free Ordinary Sequent Calculi for Logics Having Generalized Finite-Valued Semantics
    Avron, Arnon
    Ben-Naim, Jonathan
    Konikowska, Beata
    [J]. LOGICA UNIVERSALIS, 2007, 1 (01) : 41 - 70
  • [4] A SEMANTICAL ANALYSIS OF CUT-FREE CALCULI FOR MODAL LOGICS
    Takano, Mitio
    [J]. REPORTS ON MATHEMATICAL LOGIC, 2018, 53 : 43 - 65
  • [5] Gentzen sequent calculi for some intuitionistic modal logics
    Lin, Zhe
    Ma, Minghui
    [J]. LOGIC JOURNAL OF THE IGPL, 2019, 27 (04) : 596 - 623
  • [6] On Herbrand-like Theorems for Cut-free Modal Sequent Logics
    Lyaletski, Alexander
    [J]. 11TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2009), 2009, : 102 - 109
  • [7] Cut-Free Tableau Calculi for some Intuitionistic Modal Logics
    Mauro Ferrari
    [J]. Studia Logica, 1997, 59 (3) : 303 - 330
  • [8] Free Logics are Cut-Free
    Indrzejczak, Andrzej
    [J]. STUDIA LOGICA, 2021, 109 (04) : 859 - 886
  • [9] Cut-Free Calculi and Relational Semantics for Temporal STIT Logics
    van Berkel, Kees
    Lyon, Tim
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2019, 2019, 11468 : 803 - 819
  • [10] Free Logics are Cut-Free
    Andrzej Indrzejczak
    [J]. Studia Logica, 2021, 109 : 859 - 886