A compositional approach to defining logics for coalgebras
From MaRDI portal
Publication:703520
DOI10.1016/j.tcs.2004.07.021zbMath1088.03030OpenAlexW2000129083MaRDI QIDQ703520
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/260002/1/tcs.pdf
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Categorical logic, topoi (03G30) Categories of machines, automata (18B20)
Related Items (7)
Coalgebraic semantics of modal logics: an overview ⋮ Modular construction of complete coalgebraic logics ⋮ Expressivity of coalgebraic modal logic: the limits and beyond ⋮ A modular approach to defining and characterising notions of simulation ⋮ 2006 Annual Meeting of the Association for Symbolic Logic ⋮ Coalgebraic logics \& duality ⋮ Modular Games for Coalgebraic Fixed Point Logics
Cites Work
- On the final sequence of a finitary set functor
- Expressive logics for coalgebras via terminal sequence induction
- On the greatest fixed point of a set functor
- Bisimulation through probabilistic testing
- Algebraically compact functors
- Coalgebraic logic
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study
- CONCUR 2004 - Concurrency Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A compositional approach to defining logics for coalgebras
