Complexity of Gentzen systems for propositional logic

被引：0
|
作者：
机构：
[1] Urquhart, Alasdair
来源：
Urquhart, Alasdair | 1600年 / 66期
关键词：
Gentzen Systems - Propositional Logic - Sequents;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] THE COMPLEXITY OF GENTZEN SYSTEMS FOR PROPOSITIONAL LOGIC
    URQUHART, A
    JOURNAL OF SYMBOLIC LOGIC, 1986, 51 (02) : 510 - 510
  • [2] THE COMPLEXITY OF GENTZEN SYSTEMS FOR PROPOSITIONAL LOGIC
    URQUHART, A
    THEORETICAL COMPUTER SCIENCE, 1989, 66 (01) : 87 - 97
  • [3] The Variant Gentzen System for the Propositional Logic
    Chen Bo
    Sui Yuefei
    Cao Cungen
    2015 11TH INTERNATIONAL CONFERENCE ON SEMANTICS, KNOWLEDGE AND GRIDS (SKG), 2015, : 162 - 167
  • [4] GENTZEN-TYPE SYSTEMS AND RESOLUTION RULES .1. PROPOSITIONAL LOGIC
    MINTS, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 417 : 198 - 231
  • [5] Monotonic and nonmonotonic gentzen deduction systems for L3-valued propositional logic
    Cungen Cao
    Lanxi Hu
    Yuefei Sui
    Frontiers of Computer Science, 2021, 15
  • [6] Monotonic and nonmonotonic gentzen deduction systems for L3-valued propositional logic
    Cao, Cungen
    Hu, Lanxi
    Sui, Yuefei
    FRONTIERS OF COMPUTER SCIENCE, 2021, 15 (03)
  • [7] GENTZEN-SYSTEMS FOR PROPOSITIONAL TEMPORAL LOGICS
    PAECH, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 385 : 240 - 253
  • [8] On the complexity of propositional quantification in intuitionistic logic
    Kremer, P
    JOURNAL OF SYMBOLIC LOGIC, 1997, 62 (02) : 529 - 544
  • [9] Proof Complexity of Propositional Default Logic
    Beyersdorff, Olaf
    Meier, Arne
    Mueller, Sebastian
    Thomas, Michael
    Vollmer, Heribert
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, 2010, 6175 : 30 - +
  • [10] Proof complexity of propositional default logic
    Beyersdorff, Olaf
    Meier, Arne
    Mueller, Sebastian
    Thomas, Michael
    Vollmer, Heribert
    ARCHIVE FOR MATHEMATICAL LOGIC, 2011, 50 (7-8): : 727 - 742
12345