Logics of time and computation
Logics of time and computation
Temporal logic of programs
Topology via logic
Abstract and concrete categories
Abstract and concrete categories
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
On the greatest fixed point of a set functor
Theoretical Computer Science
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
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
A coalgebraic view on positive modal logic
Theoretical Computer Science - Selected papers of CMCS'03
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic Semantics for Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterising behavioural equivalence: three sides of one coin
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Free Heyting algebras: revisited
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Presenting functors on many-sorted varieties and applications
Information and Computation
Traces for coalgebraic components
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
This paper studies coalgebras from the perspective of finite observations. We introduce the notion of finite step equivalence and a corresponding category with finite step equivalence-preserving morphisms. This category always has a final object, which generalises the canonical model construction from Kripke models to coalgebras. We then turn to logics whose formulae are invariant under finite step equivalence, which we call logics of rank $\omega$. For these logics, we use topological methods and give a characterisation of compact logics and definable classes of models.