Completeness for coalgebraic fixpoint logic
From MaRDI portal
Recommendations
Cited in
(21)- A propositional dynamic logic for instantial neighborhood semantics
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Theoretical Aspects of Computing – ICTAC 2005
- scientific article; zbMATH DE number 1223543 (Why is no real title available?)
- Completeness for flat modal fixpoint logics
- Some Sahlqvist Completeness Results for Coalgebraic Logics
- Complete Coinductive Theories. I
- Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
- An expressive completeness theorem for coalgebraic modal -calculi
- A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
- A coalgebraic view on reachability
- Automata and fixed point logic: a coalgebraic perspective
- Coalgebraic logics \& duality
- Automata and fixed point logics for coalgebras
- EXPTIME tableaux for the coalgebraic \(\mu\)-calculus
- Modular games for coalgebraic fixed point logics
- Weak completeness of coalgebraic dynamic logics
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- Completeness and Decidability Results for CTL in Coq
- Completeness for the coalgebraic cover modality
This page was built for publication: Completeness for coalgebraic fixpoint logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5278393)
