Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Automata and Algebras in Categories
Automata and Algebras in Categories
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Automata and Coinduction (An Exercise in Coalgebra)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
Coalgebraic modal logic of finite rank
Mathematical Structures in Computer Science
Automata and fixed point logic: a coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Stochastic Relations
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Electronic Notes in Theoretical Computer Science (ENTCS)
Predicate Liftings Versus Nabla Modalities
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coalgebraic Perspective on Monotone Modal Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
The goldblatt-thomason theorem for coalgebras
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Completeness for flat modal fixpoint logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Presenting functors by operations and equations
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
On monotone modalities and adjointness
Mathematical Structures in Computer Science
Relation liftings on preorders and posets
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
| Hi-index | 0.00 |
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviours of the system. A fundamental question in this area is how to obtain, for an arbitrary functor T, a logic for T-coalgebras. We compare two existing proposals, Moss's coalgebraic logic and the logic of all predicate liftings, by providing one-step translations between them, extending the results in [Raul Andres Leal, Predicate liftings versus nabla modalities, Electr. Notes Theor. Comput. Sci. 203 (2008), no. 5, 195-220] by making systematic use of Stone duality. Our main contribution then is a novel coalgebraic logic, which can be seen as an equational axiomatization of Moss's logic. The three logics are equivalent for a natural but restricted class of functors. We give examples showing that the logics fall apart in general. Finally, we argue that the quest for a generic logic for T-coalgebras is still open in the general case.