Abstract
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. © 2011 Springer-Verlag GmbH.
Author supplied keywords
Cite
CITATION STYLE
Hemaspaandra, E., & Schnoor, H. (2011). A universally defined undecidable unimodal logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6907 LNCS, pp. 364–375). https://doi.org/10.1007/978-3-642-22993-0_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
