A Universally Defined Undecidable Unimodal Logic

被引：0
|
作者：
Hemaspaandra, Edith [1 ]
Schnoor, Henning [2 ]
机构：
[1] Rochester Inst Technol, Dept Comp Sci, Rochester, NY 14623 USA
[2] Univ Kiel, Inst Comp Sci, Kiel, Germany
来源：
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011 | 2011年 / 6907卷
关键词：
modal logic; satisfiability problems; decidability; COMPLEXITY; PRODUCTS; TIME;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is an undecidable unimodal logic that can be obtained by restricting the allowed models with an equality-free first-order formula in which only universal quantifiers appear.
引用
收藏
页码：364 / 375
页数：12
相关论文
共 50 条
  • [1] UNDECIDABLE RELEVANT LOGIC
    MEYER, RK
    ROUTLEY, R
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1973, 19 (05): : 389 - 397
  • [2] Quantum logic is undecidable
    Tobias Fritz
    Archive for Mathematical Logic, 2021, 60 : 329 - 341
  • [3] Action Logic is Undecidable
    Kuznetsov, Stepan
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2021, 22 (02)
  • [4] Quantum logic is undecidable
    Fritz, Tobias
    ARCHIVE FOR MATHEMATICAL LOGIC, 2021, 60 (3-4) : 329 - 341
  • [5] The Logic of Action Lattices is Undecidable
    Kuznetsov, Stepan
    2019 34TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2019,
  • [6] Derrida and Formal Logic: Formalising the Undecidable
    Livingston, Paul
    DERRIDA TODAY, 2010, 3 (02) : 221 - 239
  • [7] UNDECIDABLE THEORIES IN STATIONARY-LOGIC
    SEESE, D
    TUSCHIK, P
    WEESE, M
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1982, 84 (04) : 563 - 567
  • [8] A UNIVERSALLY FREE MODAL LOGIC
    Yang, Syraya Chin-mu
    PROCEEDINGS OF THE 11TH ASIAN LOGIC CONFERENCE: IN HONOR OF PROFESSOR CHONG CHITAT ON HIS 60TH BIRTHDAY, 2012, : 159 - 180
  • [9] Universally Koszul algebras defined by graphs
    Zaare-Nahandi, Rashid
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2012, 15 (06): : 349 - 352
  • [10] UNDECIDABLE OPTIMIZATION PROBLEMS FOR DATABASE LOGIC PROGRAMS
    GAIFMAN, H
    MAIRSON, H
    SAGIV, Y
    VARDI, MY
    JOURNAL OF THE ACM, 1993, 40 (03) : 683 - 713
12345