License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1855
URN: urn:nbn:de:0030-drops-18559
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1855/

Schröder, Lutz ; Pattinson, Dirk

Strong Completeness of Coalgebraic Modal Logics

pdf-format:
Dokument 1.pdf (132 KB)


Abstract

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.

BibTeX - Entry

@InProceedings{schrder_et_al:LIPIcs:2009:1855,
  author =	{Lutz Schr{\"o}der and Dirk Pattinson},
  title =	{{Strong Completeness of Coalgebraic Modal Logics}},
  booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{673--684},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-09-5},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{3},
  editor =	{Susanne Albers and Jean-Yves Marion},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1855},
  URN =		{urn:nbn:de:0030-drops-18559},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1855},
  annote =	{Keywords: Logic in computer science, Semantics, Deduction, Modal logic, Coalgebra}
}

Keywords: Logic in computer science, Semantics, Deduction, Modal logic, Coalgebra
Seminar: 26th International Symposium on Theoretical Aspects of Computer Science
Issue date: 2009
Date of publication: 19.02.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI