On Herbrand-like Theorems for Cut-free Modal Sequent Logics

被引：0
|
作者：
Lyaletski, Alexander [1 ]
机构：
[1] Kyiv Natl Taras Shevchenko Univ, Fac Cybernet, Kiev, Ukraine
来源：
11TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2009) | 2009年
关键词：
D O I：
10.1109/SYNASC.2009.63
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The purpose of the research presented in this paper is to extend the author's results on sequent forms of Herbrand theorems for classical and intuitionistic logics onto classical and intuitionistic modal sequent logics. It was found that the technique reported at the SYNASC 2008 symposium and based on the original notions of admissibility and compatibility can satisfactorily be applied for proving Herbrand theorems for the logics under consideration in the sequent form.
引用
收藏
页码：102 / 109
页数：8
相关论文
共 49 条
  • [21] A cut-free and invariant-free sequent calculus for PLTL
    Gaintzarain, Joxe
    Hermo, Montserrat
    Lucio, Paqui
    Navarro, Marisa
    Orejas, Fernando
    [J]. COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2007, 4646 : 481 - +
  • [22] A cut-free sequent calculus for relevant logic RW*
    Ilic, Mirjana
    Boricici, Branislav
    [J]. LOGIC JOURNAL OF THE IGPL, 2014, 22 (04) : 673 - 695
  • [23] A Cut-Free Sequent Calculus for Defeasible Erotetic Inferences
    Jared Millson
    [J]. Studia Logica, 2019, 107 : 1279 - 1312
  • [24] CUT-FREE PROOF SYSTEMS FOR GEACH LOGICS
    Fitting, Melvin
    [J]. JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 2015, 2 (02): : 17 - 64
  • [25] On Some Problems of Efficient Inference Search in First-order Cut-free Modal Sequent Calculi
    Lyaletski, Alexander
    [J]. PROCEEDINGS OF THE 10TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, 2009, : 39 - 46
  • [26] 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
  • [27] 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
  • [28] 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 - +
  • [29] ON A CERTAIN CUT-FREE AXIOMATIZATION OF SOME INTERMEDIATE LOGICS
    RAUSZER, C
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1984, 49 (02) : 703 - 703
  • [30] Cut-free Sequent Calculus and Natural Deduction for the Tetravalent Modal Logic (vol 109, pg 1347, 2021)
    Figallo, Martin
    [J]. STUDIA LOGICA, 2022, 110 (03) : 879 - 879
12345