Semantical Principles in the Modal Logic of Coalgebras

Authors:
Dirk Pattinson
Affiliations:
-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 9
Cited 5

Modal and temporal logics

Handbook of logic in computer science (vol. 2)
On the greatest fixed point of a set functor

Theoretical Computer Science
Specifying coalgebras with modal logic

Theoretical Computer Science
From modal logic to terminal coalgebras

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
A Final Coalgebra Theorem

Category Theory and Computer Science
On Observing Nondeterminism and Concurrency

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Universal coalgebra: a theory of systems

Universal coalgebra: a theory of systems
On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

Mathematical Structures in Computer Science

Logics Admitting Final Semantics

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Structural Operational Semantics and Modal Logic, Revisited

Electronic Notes in Theoretical Computer Science (ENTCS)
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
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
The least fibred lifting and the expressivity of coalgebraic modal logic

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames and many types of automata. This paper presents a multimodal language which is bisimulation invariant and (under a natural completeness condition) expressive enough to characterise elements of the underlying state space up to bisimulation. Like Moss' coalgebraic logic, the theory can be applied to an arbitrary signature functor on the category of sets. Also, an upper bound for the size of conjunctions and disjunctions needed to obtain characteristic formulas is given.