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
关键词
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 条