Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics

Coalgebras provide a uniform framework for the semantics of a large class of (mostly non-normal) modal logics, including e.g. monotone modal logic, probabilistic and graded modal logic, and coalition logic, as well as the usual Kripke semantics of modal logic. In earlier work, the finite model property for coalgebraic logics has been established w.r.t. the class of all structures appropriate for a given logic at hand; the corresponding modal logics are characterised by being axiomatised in rank 1, i.e. without nested modalities. Here, we extend the range of coalgebraic techniques to cover logics that impose global properties on their models, formulated as frame conditions with possibly nested modalities on the logical side (in generalisation of frame conditions such as symmetry or transitivity in the context of Kripke frames). We show that the finite model property for such logics follows from the finite algebra property of the associated class of complex algebras, and then investigate sufficient conditions for the finite algebra property to hold. Example applications include extensions of coalition logic and logics of uncertainty and knowledge.

[1]  Marcello M. Bonsangue,et al.  Presenting Functors by Operations and Equations, in Foundations of Software Science and Computation Structures , 2006, SIGMETRICS 2006.

[2]  Yde Venema,et al.  Stone coalgebras , 2004, Theor. Comput. Sci..

[3]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[4]  Dirk Pattinson,et al.  Coalgebraic modal logic: soundness, completeness and decidability of local consequence , 2003, Theor. Comput. Sci..

[5]  Marcello M. Bonsangue,et al.  Duality for Logics of Transition Systems , 2005, FoSSaCS.

[6]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[7]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[8]  Dirk Pattinson,et al.  Modular Algorithms for Heterogeneous Modal Logics , 2007, ICALP.

[9]  Dirk Pattinson,et al.  Rank-1 Modal Logics are Coalgebraic , 2007, J. Log. Comput..

[10]  Corina Cîrstea,et al.  Modular Construction of Modal Logics , 2004, CONCUR.

[11]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[12]  Dirk Pattinson,et al.  PSPACE Bounds for Rank-1 Modal Logics , 2006, LICS.

[13]  Ronald Fagin,et al.  Reasoning about knowledge and probability , 1988, JACM.

[14]  Lutz Schröder,et al.  A finite model construction for coalgebraic modal logic , 2006, J. Log. Algebraic Methods Program..

[15]  Marcello M. Bonsangue,et al.  Presenting Functors by Operations and Equations , 2006, FoSSaCS.

[16]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[17]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[18]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[19]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[20]  Kit Fine,et al.  In so many possible worlds , 1972, Notre Dame J. Formal Log..

[21]  E. J. Lemmon,et al.  Algebraic semantics for modal logics I , 1966, Journal of Symbolic Logic (JSL).

[22]  Aviad Heifetz,et al.  Probability Logic for Type Spaces , 2001, Games Econ. Behav..

[23]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[24]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[25]  Kosta Dosen,et al.  Duality between modal algebras and neighbourhood frames , 1989, Stud Logica.

[26]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[27]  Corina Cîrstea,et al.  A compositional approach to defining logics for coalgebras , 2004, Theor. Comput. Sci..