Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Bisimulation through probabilistic testing
Information and Computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Additions and corrections to “Terminal coalgebras in well-founded set theory”
Theoretical Computer Science
A theory of higher order communicating systems
Information and Computation
Undecidability in integer weighted finite automata
Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Specifying coalgebras with modal logic
Theoretical Computer Science
Logics Admitting Final Semantics
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A compositional approach to defining logics for coalgebras
Theoretical Computer Science - Selected papers of CMCS'03
On the final sequence of a finitary set functor
Theoretical Computer Science
PSPACE Bounds for Rank-1 Modal Logics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A coalgebraic approach to the semantics of the ambient calculus
Theoretical Computer Science - Algebra and coalgebra in computer science
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
A Coalgebraic Perspective on Monotone Modal Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
A finite model construction for coalgebraic modal logic
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
The least fibred lifting and the expressivity of coalgebraic modal logic
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
Terminal Sequence Induction via Games
Logic, Language, and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic Logic over Measurable Spaces: Behavioral and Logical Equivalence
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic modal logic in COCASL
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Optimizing Conditional Logic Reasoning within CoLoSS
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterising behavioural equivalence: three sides of one coin
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Resource bisimilarity and graded bisimilarity coincide
Information Processing Letters
Probabilistic Logical Characterization
Information and Computation
Coalgebraic logic over general measurable spaces ??? a survey
Mathematical Structures in Computer Science
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
On the fusion of coalgebraic logics
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Coalgebraic correspondence theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Modalities in the Stone age: A comparison of coalgebraic logics
Theoretical Computer Science
The Logic of Exact Covers: Completeness and Uniform Interpolation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 5.23 |
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modelled as coalgebras. Logics with modal operators obtained from so-called predicate liftings have been shown to be invariant under behavioural equivalence. Expressivity results stating that, conversely, logically indistinguishable states are behaviourally 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.