A Simplest Undecidable Modal Logic
Logic in Computer Science
2011-05-05 v1 Computational Complexity
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 modal logic that can be obtained by restricting the allowed models with a first-order formula in which only universal quantifiers appear.
Cite
@article{arxiv.1105.0845,
title = {A Simplest Undecidable Modal Logic},
author = {Edith Hemaspaandra and Henning Schnoor},
journal= {arXiv preprint arXiv:1105.0845},
year = {2011}
}
Comments
18 pages