Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics


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 .

DOI: 10.1007/978-3-662-44602-7_22

Extracted Key Phrases

Cite this paper

@inproceedings{Hansen2014StrongCF, title={Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics}, author={Helle Hvid Hansen and Clemens Kupke and Raul Andres Leal}, booktitle={IFIP TCS}, year={2014} }