Topology via logic
Duality beyond sober spaces: topological spaces and observation frames
Selected papers of the workshop on Topology and completion in semantics
Handbook of logic in computer science (vol. 3)
Toward an infinitary logic of domains: Abramsky logic for transition systems
Information and Computation
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Specifying coalgebras with modal logic
Theoretical Computer Science
From modal logic to terminal coalgebras
Theoretical Computer Science
Modal logic
Automata and Algebras in Categories
Automata and Algebras in Categories
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
Algebraic Semantics for Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
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
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
ACM SIGACT News
Coalgebraic Modal Logic Beyond Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
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
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
Coalgebraic logic and synthesis of mealy machines
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Structural Operational Semantics and Modal Logic, Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
On universal algebra over nominal sets
Mathematical Structures in Computer Science
Presenting functors on many-sorted varieties and applications
Information and Computation
Equational presentations of functors and monads
Mathematical Structures in Computer Science
Modalities in the Stone age: A comparison of coalgebraic logics
Theoretical Computer Science
| Hi-index | 0.00 |
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the ‘Stone dual' L of T. We show that such a functor always gives rise to an ‘abstract' adequate logic for T-coalgebras and investigate under which circumstances it gives rise to a ‘concrete' such logic, that is, a logic with an inductively defined syntax and proof system. We obtain a result that allows us to prove adequateness of logics uniformly for a large number of different types of transition systems and give some examples of its usefulness.