@inproceedings{07e52bf49f60424f8986000c986f3ce4,
title = "Strong completeness for iteration-free coalgebraic dynamic logics",
abstract = "We present a (co)algebraic treatment of iteration-free dynamic modal logics such as Propositional Dynamic Logic (PDL) and Game Logic (GL), both without star. The main observation is that the program/game constructs of PDL/GL arise from monad structure, and the axioms of these logics correspond to certain compatibilty requirements between the modalities and this monad structure. Our main contribution is a general soundness and strong completeness result for PDL-like logics for T-coalgebras where T is a monad and the {"}program{"} constructs are given by sequential composition, test, and pointwise extensions of operations of T.",
keywords = "propositional dynamic logic, game logic, strong completeness, coalgebraic dynamic modal logic",
author = "Clemens Kupke and Hansen, {Helle Hvid} and Leal, {Raul Andres}",
note = " The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44602-7_22",
year = "2014",
month = sep,
doi = "10.1007/978-3-662-44602-7_22",
language = "English",
isbn = "978-3-662-44601-0",
volume = "8705",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "281--295",
editor = "Josep Diaz and Ivan Lanese and Sangiorgi, {Davide }",
booktitle = "Theoretical Computer Science",
}