Topology via logic
A domain equation for bisimulation
Information and Computation
Handbook of logic in computer science (vol. 3)
Control flow semantics
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Modal logic
Partializing Stone Spaces using SFP Domains (Extended Abstract)
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Mathematical Structures in 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
ACM SIGACT News
A modal proof theory for final polynomial coalgebras
Theoretical Computer Science
Coalgebraic Logic over Measurable Spaces: Behavioral and Logical Equivalence
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic Semantics for Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebras and Modal Expansions of Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Free modal algebras: a coalgebraic perspective
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Beyond rank 1: algebraic semantics and finite models for coalgebraic logics
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
On the fusion of coalgebraic logics
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international 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
A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Duality in Logic and Computation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We argue that the category of Stone spaces forms an interesting base category for coalgebras, in particular, if one considers the Vietoris functor as an analogue to the power set functor on the category of sets.We prove that the so-called descriptive general frames, which play a fundamental role in the semantics of modal logics, can be seen as Stone coalgebras in a natural way. This yields a duality between modal algebras and coalgebras for the Vietoris functor.Building on this idea, we introduce the notion of a Vietoris polynomial functor over the category of Stone spaces. For each such functor T we provide an adjunction between T-sorted Boolean algebras with operators and the Stone coalgebras for T. We also identify the subcategory of algebras on which the adjunction restricts to an equivalence and show that the final T-coalgebra is the dual of the initial T-BAO.