Objects and classes, co-algebraically
Object orientation with parallelism and persistence
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Covarieties and complete covarieties
Theoretical Computer Science
Specifying coalgebras with modal logic
Theoretical Computer Science
Equational axiomatizability for coalgebra
Theoretical Computer Science
Modal logic
Semantical Principles in the Modal Logic of Coalgebras
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Coalgebras and modal logic for parameterised endofunctors
Coalgebras and modal logic for parameterised endofunctors
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
Coalgebraic modal logic in COCASL
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Expressivity of coalgebraic modal logic: the limits and beyond
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
A logic for coalgebras is said to admit final semantics iff-- up to some technical requirements--all definable classes contain a fully abstract final coalgebra. It is shown that a logic admits final semantics iff the formulas of the logic are preserved under coproducts (disjoint unions) and quotients (homomorphicimages).