Expressivity of coalgebraic modal logic: The limits and beyond
暂无分享,去创建一个
[1] Mogens Nielsen,et al. Foundations of Software Science and Computation Structures , 2002, Lecture Notes in Computer Science.
[2] Markus Roggenbach,et al. Algebraic-coalgebraic specification in CoCasl , 2006, J. Log. Algebraic Methods Program..
[3] M. de Rijke,et al. Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.
[4] Lutz Schröder. Expressivity of Coalgebraic Modal Logic: The Limits and Beyond , 2005, FoSSaCS.
[5] Till Mossakowski,et al. A coalgebraic approach to the semantics of the ambient calculus , 2006, Theor. Comput. Sci..
[6] Aviad Heifetz,et al. Probability Logic for Type Spaces , 2001, Games Econ. Behav..
[7] A. Tarski,et al. Boolean Algebras with Operators. Part I , 1951 .
[8] Albert Visser,et al. Finality regained: A coalgebraic study of Scott-sets and multisets , 1999, Arch. Math. Log..
[9] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[10] John Power,et al. An axiomatics for categories of coalgebras , 1998, CMCS.
[11] Bartek Klin. The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic , 2005, CALCO.
[12] Bent Thomsen. A Theory of Higher Order Communicating Systems , 1995, Inf. Comput..
[13] Dirk Pattinson. Expressive Logics for Coalgebras via Terminal Sequence Induction , 2004, Notre Dame J. Formal Log..
[14] Helle Hvid Hansen,et al. A Coalgebraic Perspective on Monotone Modal Logic , 2004, CMCS.
[15] Dirk Pattinson,et al. PSPACE Bounds for Rank-1 Modal Logics , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[16] Martin Rößiger,et al. Coalgebras and Modal Logic , 2000, CMCS.
[17] Jan J. M. M. Rutten,et al. Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..
[18] Lutz Schröder. A Finite Model Construction for Coalgebraic Modal Logic , 2006, FoSSaCS.
[19] Vincent Danos,et al. Reversible Communicating Systems , 2004, CONCUR.
[20] Corina Cîrstea,et al. Modular Construction of Modal Logics , 2004, CONCUR.
[21] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[22] Richard Spencer-Smith,et al. Modal Logic , 2007 .
[23] James Worrell,et al. On the final sequence of a finitary set functor , 2005, Theor. Comput. Sci..
[24] Corina Cîrstea,et al. A compositional approach to defining logics for coalgebras , 2004, Theor. Comput. Sci..
[25] Erik P. de Vink,et al. A hierarchy of probabilistic system types , 2003, CMCS.
[26] J. Siekmann,et al. A Noetherian and confluent rewrite system for idempotent semigroups , 1982 .
[27] Bartek Klin. A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces , 2004, CMCS.
[28] Dirk Pattinson,et al. Semantical Principles in the Modal Logic of Coalgebras , 2001, STACS.
[29] Michael Barr,et al. Additions and Corrections to "Terminal Coalgebras in Well-founded Set Theory" , 1994, Theor. Comput. Sci..
[30] Michael Barr,et al. Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..
[31] Alexander Kurz. Logics Admitting Final Semantics , 2002, FoSSaCS.
[32] Bart Jacobs,et al. Towards a Duality Result in Coalgebraic Modal Logic , 2000, CMCS.
[33] Lawrence S. Moss,et al. Coalgebraic Logic , 1999, Ann. Pure Appl. Log..
[34] Bart Jacobs,et al. The Coalgebraic Class Specification Language CCSL , 2001, J. Univers. Comput. Sci..
[35] Tero Harju,et al. Undecidability in Integer Weighted Finite Automata , 1999, Fundam. Informaticae.
[36] Alexander Kurz,et al. Specifying Coalgebras with Modal Logic , 1998, CMCS.
[37] Robin Milner,et al. Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.
[38] A. Tarski,et al. Boolean Algebras with Operators , 1952 .
[39] Alexander Kurz,et al. Algebraic Semantics for Coalgebraic Logics , 2004, CMCS.