Abstract

Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from so-called predicate liftings have been shown to be invariant under behavioral equivalence. Expressivity results stating that, conversely, logically indistinguishable states are behaviorally equivalent depend on the existence of separating sets of predicate liftings for the signature functor at hand. Here, we provide a classification result for predicate liftings which leads to an easy criterion for the existence of such separating sets, and we give simple examples of functors that fail to admit expressive normal or monotone modal logics, respectively, or in fact an expressive (unary) modal logic at all. We then move on to polyadic modal logic, where modal operators may take more than one argument formula. We show that every accessible functor admits an expressive polyadic modal logic. Moreover, expressive polyadic modal logics are, unlike unary modal logics, compositional.

Citations

448	Algebraic laws for nondeterminism and concurrency - Hennessy, Milner - 1985
371	A.: Bisimulation through Probabilistic Testing - Larsen, Skou - 1991
170	Boolean algebras with operators - Jónsson, Tarski - 1951
136	Modal Logic - Chellas - 1980
117	Terminal coalgebras in well-founded set theory - Barr - 1993
55	Logics for Coalgebras and Applications to Computer Science - Kurz - 2001
38	Universal coalgebra: A theory of systems, Theoret - Rutten
33	A hierarchy of probabilistic system types. Theoretical Computer Science, 327:3–22, 2004. sets. 3 In topology, a Gδ set is a countable intersection of open sets and a Fσ set in a countable union of closed - Bartels, Sokolova, et al.
32	Coalgebras and modal logic - Rößiger
26	Probability Logic for Type Spaces - Heifetz, Mongin
24	A coalgebraic perspective on monotone modal logic - Hansen, Kupke - 2004
21	An axiomatics for categories of coalgebras - Power, Watanabe - 1998
20	Finality regained: A coalgebraic study of Scott-sets and multisets - D’Agostino, Visser
19	Modular construction of modal logics - Cîrstea, Pattinson - 2004
18	Towards a duality result in the modal logic of coalgebras - Jacobs - 2000
17	A coalgebraic approach to process equivalence and a coinduction principle for traces - Klin
14	Algebraic semantics for coalgebraic logics - Kupke, Kurz, et al. - 2004
12	Algebraic-co-algebraic specification - Mossakowski, Schröder, et al.
9	A compositional approach to defining logics for coalgebras. Theoret - Cîrstea
7	Coalgebraic logic, Ann - Moss - 1999
6	Expressivity Results in the Modal Logic of Coalgebras - Pattinson - 2001
6	A noetherian and confluent rewrite system for idempotent Semigroups. Semigroup Forum - Siekmann, Szabó - 1982
6	The least fibred lifting and the expressivity of coalgebraic modal logic - Klin - 2005
4	Additions and corrections to “Terminal coalgebras in well-founded set theory.” Theor - Barr - 1994
3	admitting final semantics - Logics - 2002
3	The Coalgebraic Class Specification Language - Rothe, Tews, et al.
3	L.: A coalgebraic approach to the semantics of the ambient calculus. TCS - Hausmann, Mossakowski, et al. - 2006
1	principles in the modal logic of coalgebras, Symposium on Theoretical - Semantical - 2001