An analysis of first-order logics of probability
Artificial Intelligence
Bisimulation through probabilistic testing
Information and Computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Modal logic
Modal Logic over Finite Structures
Journal of Logic, Language and Information
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
Modal Characterisation Theorems over Special Classes of Frames
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
Bisimulation for neighbourhood structures
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
From T-coalgebras to filter structures and transition systems
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Coalgebraic predicate logic: equipollence results and proof theory
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Coalgebraic announcement logics
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In particular, we prove a coalgebraic version of the van Benthem/Rosen theorem stating that both over arbitrary structures and over finite structures, coalgebraic modal logic is precisely the bisimulation invariant fragment of first-order logic.