Strong Completeness of Coalgebraic Modal Logics

Authors Lutz Schröder, Dirk Pattinson

Thumbnail PDF


  • Filesize: 131 kB
  • 12 pages

Document Identifiers

Author Details

Lutz Schröder
Dirk Pattinson

Cite AsGet BibTex

Lutz Schröder and Dirk Pattinson. Strong Completeness of Coalgebraic Modal Logics. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 673-684, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics often present subtle difficulties - up to the point that canonical models may fail to exist, as is the case e.g. in most probabilistic logics. Here, we present a generic canonical model construction in the semantic framework of coalgebraic modal logic, which pinpoints coherence conditions between syntax and semantics of modal logics that guarantee strong completeness. We apply this method to reconstruct canonical model theorems that are either known or folklore, and moreover instantiate our method to obtain new strong completeness results. In particular, we prove strong completeness of graded modal logic with finite multiplicities, and of the modal logic of exact probabilities.
  • Logic in computer science
  • Semantics
  • Deduction
  • Modal logic
  • Coalgebra


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

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail