Cut-free sequent-style systems for a logic associated to involutive Stone algebras

被引:4
|
作者
Cantu, Liliana M. [1 ]
Figallo, Martin [2 ]
机构
[1] Univ Tecnol Nacl, Fac Reg Tierra del Fuego, IPES Florentino Ameghino, V9410, Ushuaia, Argentina
[2] Univ Nacl Sur, Inst Matemat, Dept Matemat, RA-8000 Bahia Blanca, Buenos Aires, Argentina
关键词
Degrees of truth; logic of formal inconsistency; Gentzen systems; involutive Stone algebras;
D O I
10.1093/logcom/exac061
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In [, ], it was introduced a logic (called Six) associated to a class of algebraic structures known as involutive Stone algebras. This class of algebras, denoted by S, was considered by the first time in [] as a tool for the study of certain problems connected to the theory of finite-valued Lukasiewicz-Moisil algebras. In fact, Six is the logic that preserves degrees of truth with respect to the class S. Among other things, it was proved that Six is a 6-valued logic that is a Logic of Formal Inconsistency (LFI ); moreover, it is possible to define a consistency operator in terms of the original set of connectives. A Gentzen-style system (which does not enjoy the cut-elimination property) for Six was given. Besides, in [], it was shown that Six is matrix logic that is determined by a finite number of matrices; more precisely, four matrices. However, this result was further sharpened in [], proving that just one of these four matrices determine Six, i.e. Six can be determined by a single 6-element logic matrix. In this work, taking advantage of this last result, we apply a method due to Avron, Ben-Naim and Konikowska [] to present different Gentzen systems for Six enjoying the cut-elimination property. This allows us to draw some conclusions about the method as well as to propose additional tools for the streamlining process. Finally, we present a decision procedure for Six based in one of these systems.
引用
收藏
页码:1684 / 1710
页数:27
相关论文
共 50 条
  • [1] Cut-free sequent systems for temporal logic
    Bruennler, Kai
    Lange, Martin
    [J]. JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2008, 76 (02): : 216 - 225
  • [2] A cut-free sequent system for the smallest interpretability logic
    Sasaki K.
    [J]. Studia Logica, 2002, 70 (3) : 353 - 372
  • [3] A cut-free sequent calculus for relevant logic RW*
    Ilic, Mirjana
    Boricici, Branislav
    [J]. LOGIC JOURNAL OF THE IGPL, 2014, 22 (04) : 673 - 695
  • [4] A cut-free labelled sequent calculus for dynamic epistemic logic
    Nomura, Shoshin
    Ono, Hiroakira
    Sano, Katsuhiko
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (01) : 321 - 348
  • [5] A Cut-Free Labelled Sequent Calculus for Dynamic Epistemic Logic
    Nomura, Shoshin
    Ono, Hiroakira
    Sano, Katsuhiko
    [J]. LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS 2016), 2016, 9537 : 283 - 298
  • [6] A cut-free sequent calculus for Bi-intuitionistic logic
    Buismani, Linda
    Gore, Rajeev
    [J]. AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, PROCEEDINGS, 2007, 4548 : 90 - +
  • [7] Cut-free Sequent Calculus and Natural Deduction for the Tetravalent Modal Logic
    Martín Figallo
    [J]. Studia Logica, 2021, 109 : 1347 - 1373
  • [8] Cut-free Sequent Calculus and Natural Deduction for the Tetravalent Modal Logic
    Figallo, Martin
    [J]. STUDIA LOGICA, 2021, 109 (06) : 1347 - 1373
  • [10] A Contraction-free and Cut-free Sequent Calculus for Propositional Dynamic Logic
    Hill, B.
    Poggiolesi, F.
    [J]. STUDIA LOGICA, 2010, 94 (01) : 47 - 72