Coalgebraic semantics of modal logics: an overview
From MaRDI portal
Publication:639647
DOI10.1016/j.tcs.2011.04.023zbMath1360.03068OpenAlexW1969533183MaRDI QIDQ639647
Publication date: 22 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.023
Related Items
Relation lifting, a survey ⋮ Hennessy-Milner and van Benthem for instantial neighbourhood logic ⋮ Coalgebraic Geometric Logic: Basic Theory ⋮ Monotone subintuitionistic logic: duality and transfer results ⋮ Generic weakest precondition semantics from monads enriched with order ⋮ CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE ⋮ Categories for Dynamic Epistemic Logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Coalgebraic trace semantics via forgetful logics ⋮ Unnamed Item ⋮ Coalgebraic minimization of automata by initiality and finality ⋮ Unnamed Item ⋮ Coalgebraic Completeness-via-Canonicity ⋮ Bisimulation proof methods in a path-based specification language for polynomial coalgebras ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Coalgebraic logics \& duality ⋮ Unnamed Item ⋮ Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
- On the final sequence of a finitary set functor
- Expressive logics for coalgebras via terminal sequence induction
- Presenting functors on many-sorted varieties and applications
- Cut elimination in coalgebraic logics
- Coequational logic for accessible functors
- A hierarchy of probabilistic system types
- A compositional approach to defining logics for coalgebras
- Stone coalgebras
- Algebra and coalgebra in computer science. Third international conference, CALCO 2009, Udine, Italy, September 7--10, 2009. Proceedings
- An incomplete system of modal logic
- Graded modalities. II. (Canonical models)
- Domain theory in logical form
- Coalgebraic logic
- A logic for reasoning about time and reliability
- Finality regained: A coalgebraic study of Scott-sets and multisets
- Universal coalgebra: A theory of systems
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Automata, logics, and infinite games. A guide to current research
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Terminal coalgebras in well-founded set theory
- Modular construction of complete coalgebraic logics
- Expressivity of coalgebraic modal logic: the limits and beyond
- Final coalgebras for functors on measurable spaces
- Automata and fixed point logic: a coalgebraic perspective
- A modal proof theory for final polynomial coalgebras
- In so many possible worlds
- Final coalgebras and the Hennessy-Milner property
- A finite model construction for coalgebraic modal logic
- Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study
- Non-Deterministic Kleene Coalgebras
- Equational Coalgebraic Logic
- Predicate Liftings Versus Nabla Modalities
- Complementation of Coalgebra Automata
- Characterising Behavioural Equivalence: Three Sides of One Coin
- Relating Coalgebraic Notions of Bisimulation
- Completeness for the coalgebraic cover modality
- Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
- PSPACE bounds for rank-1 modal logics
- Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
- Exemplaric Expressivity of Modal Logics
- Coalgebraic Correspondence Theory
- Automata for the modal μ-calculus and related results
- Flat Coalgebraic Fixed Point Logics
- Automata for Coalgebras: An Approach Using Predicate Liftings
- The Goldblatt-Thomason Theorem for Coalgebras
- Nabla Algebras and Chu Spaces
- Presburger Modal Logic Is PSPACE-Complete
- Coalgebraic Hybrid Logic
- Coalgebraic Automata Theory: Basic Results
- Neighbourhood Structures: Bisimilarity and Basic Model Theory
- An incomplete decidable modal logic
- Algebraic laws for nondeterminism and concurrency
- Alternation
- Proving the Correctness of Multiprocess Programs
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Two simple incomplete modal logics
- Reasoning about knowledge and probability
- A Modal Logic for Coalitional Power in Games
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- Computer Science Logic
- Generic Trace Semantics via Coinduction
- Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics
- Relational algebras
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Universal grammar
- Foundations of Software Science and Computational Structures
- Global Caching for Coalgebraic Description Logics
- Probability logic for type spaces
- What is the coalgebraic analogue of Birkhoff's variety theorem?
