Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Specifying coalgebras with modal logic
Theoretical Computer Science
Applying Algebraic Logic to Logic
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
Coalgebraic modal logic of finite rank
Mathematical Structures in Computer Science
ACM SIGACT News
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
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
Presenting functors on many-sorted varieties and applications
Information and Computation
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
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Ultrafilter extensions for coalgebras
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
| Hi-index | 0.02 |
With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T-coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T, we construct an endofunctor L such that L-algebras provide a sound and complete (algebraic) semantics of the logic. We show that if L is dual to T, then soundness and completeness of the algebraic semantics immediately yield the corresponding property of the coalgebraic semantics. We conclude by characterising duality between L and T in terms of the axioms of L. This provides a criterion for proving concretely given logics to be sound, complete and expressive.