Complexity of Gentzen systems for propositional logic

被引:0
|
作者
机构
[1] Urquhart, Alasdair
来源
Urquhart, Alasdair | 1600年 / 66期
关键词
Gentzen Systems - Propositional Logic - Sequents;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [12] Proof complexity of propositional default logic
    Olaf Beyersdorff
    Arne Meier
    Sebastian Müller
    Michael Thomas
    Heribert Vollmer
    Archive for Mathematical Logic, 2011, 50 : 727 - 742
  • [13] Complexity of Propositional Independence and Inclusion Logic
    Hannula, Miika
    Kontinen, Juha
    Virtema, Jonni
    Vollmer, Heribert
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT I, 2015, 9234 : 269 - 280
  • [14] Gentzen-style axiomatizations for some conservative extensions of basic propositional logic
    Aghaei M.
    Ardeshir M.
    Studia Logica, 2001, 68 (2) : 263 - 285
  • [15] The lattice-modalized propositional logic: Distributivity and modularity of the Gentzen deduction system GL
    Li Wei
    Sui Yuefei
    Wang Yuhui
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2017, 33 (02) : 733 - 740
  • [16] Complexity of propositional projection temporal logic with star
    Tian, Cong
    Duan, Zhenhua
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2009, 19 (01) : 73 - 100
  • [18] Parameterized Complexity of Propositional Inclusion and Independence Logic
    Mahmood, Yasir
    Virtema, Jonni
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2023, 2023, 13923 : 274 - 291
  • [19] Propositional defeasible logic has linear complexity
    Maher, MJ
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2001, 1 : 691 - 711
  • [20] Complexity of computing with extended propositional logic programs
    Marek, VW
    Rajasekar, A
    Truszczynski, M
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1995, 15 (3-4) : 357 - 378