Document Open Access Logo

Modal Logics Definable by Universal Three-Variable Formulas

Authors Emanuel Kieronski, Jakub Michaliszyn, Jan Otop



PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2011.264.pdf
  • Filesize: 0.71 MB
  • 12 pages

Document Identifiers

Author Details

Emanuel Kieronski
Jakub Michaliszyn
Jan Otop

Cite AsGet BibTex

Emanuel Kieronski, Jakub Michaliszyn, and Jan Otop. Modal Logics Definable by Universal Three-Variable Formulas. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, pp. 264-275, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.FSTTCS.2011.264

Abstract

We consider the satisfiability problem for modal logic over classes of structures definable by universal first-order formulas with three variables. We exhibit a simple formula for which the problem is undecidable. This improves an earlier result in which nine variables were used. We also show that for classes defined by three-variable, universal Horn formulas the problem is decidable. This subsumes decidability results for many natural modal logics, including T, B, K4, S4, S5.
Keywords
  • modal logic
  • decidability

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail