Coalgebraic modal logic: soundness, completeness and decidability of local consequence

DOI10.1016/S0304-3975(03)00201-9zbMath1052.03009OpenAlexW1982431152MaRDI QIDQ1884901

Dirk Pattinson

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00201-9

zbMATH Keywords

coalgebrasinductioncoalgebraic modal logicendofunctorsfinitary modal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Categorical logic, topoi (03G30)

Related Items

Characterising Behavioural Equivalence: Three Sides of One Coin ⋮ On a categorical framework for coalgebraic modal logic ⋮ The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games ⋮ Coalgebraic Geometric Logic: Basic Theory ⋮ Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence ⋮ A finite model construction for coalgebraic modal logic ⋮ Coalgebraic representations of distributive lattices with operators ⋮ Generic weakest precondition semantics from monads enriched with order ⋮ Abstract categorical logic ⋮ Subsequential transducers: a coalgebraic perspective ⋮ Presenting functors on many-sorted varieties and applications ⋮ Cut elimination in coalgebraic logics ⋮ Coequational logic for accessible functors ⋮ Proof systems for Moss' coalgebraic logic ⋮ Modalities in the Stone age: a comparison of coalgebraic logics ⋮ Unnamed Item ⋮ Morpho-logic from a topos perspective -- application to symbolic AI ⋮ Coalgebraic semantics of modal logics: an overview ⋮ Characterization, definability and separation via saturated models ⋮ Completeness for \(\mu\)-calculi: a coalgebraic approach ⋮ On monotone modalities and adjointness ⋮ (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras ⋮ Modular construction of complete coalgebraic logics ⋮ Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics ⋮ Bisimulation proof methods in a path-based specification language for polynomial coalgebras ⋮ Expressive logics for coalgebras via terminal sequence induction ⋮ Global Caching for Coalgebraic Description Logics ⋮ Unnamed Item ⋮ Coalgebraic Hybrid Logic ⋮ Coalgebraic logics \& duality ⋮ Predicate liftings and functor presentations in coalgebraic expression languages ⋮ Equational Coalgebraic Logic ⋮ Neighbourhood Contingency Bisimulation ⋮ Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic ⋮ Modal Predicates and Coequations ⋮ Lax extensions of coalgebra functors and their logic ⋮ Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic ⋮ Modular Games for Coalgebraic Fixed Point Logics ⋮ Coalgebraising Subsequential Transducers ⋮ Functorial Coalgebraic Logic: The Case of Many-sorted Varieties ⋮ Admissibility of Cut in Coalgebraic Logics ⋮ Coequational Logic for Finitary Functors

Cites Work

• On the greatest fixed point of a set functor
• Structural induction and coinduction in a fibrational setting
• Coalgebraic logic
• Universal coalgebra: A theory of systems
• Terminal coalgebras in well-founded set theory
• Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study
• Specifying coalgebras with modal logic
• From modal logic to terminal coalgebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coalgebraic modal logic: soundness, completeness and decidability of local consequence