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.

[1]  Dirk Pattinson,et al.  Coalgebraic semantics of modal logics: An overview , 2011, Theor. Comput. Sci..

[2]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[3]  E. Manes.  Algebraic Theories in a Category , 1976 .

[5]  G. M. Kelly,et al.  Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads , 1993 .

[6]  Rohit Parikh,et al.  Game Logic - An Overview , 2003, Stud Logica.

[7]  Dirk Pattinson,et al.  PSPACE Bounds for Rank-1 Modal Logics , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[8]  Bart Jacobs,et al.  Dijkstra Monads in Monadic Computation , 2014, CMCS.

[9]  Sergey Goncharov,et al.  A Relatively Complete Generic Hoare Logic for Order-Enriched Effects , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[10]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[11]  Helle Hvid Hansen,et al.  Monotonic modal logics , 2003 .

[12]  Lutz Schröder,et al.  Expressivity of coalgebraic modal logic: The limits and beyond , 2008, Theor. Comput. Sci..

[13]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[14]  R. Parikh.  The logic of games and its applications , 1985 .

[15]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[16]  Bart Jacobs,et al.  New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic , 2012, Log. Methods Comput. Sci..

[17]  Rohit Parikh,et al.  An Elementary Proof of the Completness of PDL , 1981, Theor. Comput. Sci..

[18]  George Markowsky,et al.  Free Completely Distributive Lattices , 1979 .

[19]  Corina Cîrstea,et al.  Modal Logics are Coalgebraic , 2008, Comput. J..

[20]  F. E. J. Linton,et al.  Some Aspects of Equational Categories , 1966 .

[21]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

[22]  Gordon D. Plotkin,et al.  Semantics for Algebraic Operations , 2001, MFPS.

[23]  Helle Hvid Hansen,et al.  Neighbourhood Structures: Bisimilarity and Basic Model Theory , 2009, Log. Methods Comput. Sci..

[24]  Dirk Pattinson,et al.  Strong Completeness of Coalgebraic Modal Logics , 2009, STACS.

[25]  Dimiter Vakarelov,et al.  Iteration-free PDL with Intersection: a Complete Axiomatization , 2001, Fundam. Informaticae.

[26]  Dietmar Berwanger.  Game Logic is Strong Enough for Parity Games , 2003, Stud Logica.

[27]  Helle Hvid Hansen,et al.  A Coalgebraic Perspective on Monotone Modal Logic , 2004, CMCS.

[28]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[29]  Alexander Kurz,et al.  Strongly Complete Logics for Coalgebras , 2012, Log. Methods Comput. Sci..