A finite model construction for coalgebraic modal logic

[1]  D. Pattinson.  Expressive Logics for Coalgebras via Terminal Sequence Induction , 2004, Notre Dame J. Formal Log..

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

[3]  Albert Visser,et al.  Finality regained: A coalgebraic study of Scott-sets and multisets , 1999, Arch. Math. Log..

[4]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[5]  Markus Roggenbach,et al.  Algebraic-coalgebraic specification in CoCasl , 2006, J. Log. Algebraic Methods Program..

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

[7]  Alexander Kurz,et al.  Algebraic Semantics for Coalgebraic Logics , 2004, CMCS.

[8]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[9]  Bart Jacobs,et al.  The Coalgebraic Class Specification Language CCSL , 2001, J. Univers. Comput. Sci..

[10]  Martin Rößiger,et al.  Coalgebras and Modal Logic , 2000, CMCS.

[11]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

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

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

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

[15]  Dirk Pattinson,et al.  Rank-1 Modal Logics Are Coalgebraic , 2007, STACS.

[16]  Lawrence S. Moss,et al.  Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[17]  Alexander Kurz,et al.  Specifying Coalgebras with Modal Logic , 1998, CMCS.

[18]  Sally Popkorn.  First Steps in Modal Logic , 1995 .

[19]  Aviad Heifetz,et al.  The Modal Logic of Probability , 1998, TARK.

[20]  Eric Pacuit,et al.  Majority Logic , 2004, KR.

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

[22]  Ignacio Darío Viglizzo,et al.  Final Sequences and Final Coalgebras for Measurable Spaces , 2005, CALCO.

[23]  Jack W. Carlyle,et al.  Realizations by Stochastic Finite Automata , 1971, J. Comput. Syst. Sci..

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

[25]  P. Turakainen.  On the minimization of linear space automata , 1972 .

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

[27]  Dirk Pattinson,et al.  Semantical Principles in the Modal Logic of Coalgebras , 2001, STACS.

[28]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[29]  Tero Harju,et al.  Undecidability in Integer Weighted Finite Automata , 1999, Fundam. Informaticae.

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

[31]  Stephan Tobies.  PSPACE Reasoning for Graded Modal Logics , 2001, J. Log. Comput..

[32]  Lutz Schröder.  A Finite Model Construction for Coalgebraic Modal Logic , 2006, FoSSaCS.

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