Sahlqvist theorem for modal fixed point logic
From MaRDI portal
Publication:418010
DOI10.1016/j.tcs.2011.11.026zbMath1268.03020OpenAlexW2079922393MaRDI QIDQ418010
Nick Bezhanishvili, I. M. Hodkinson
Publication date: 14 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.026
Related Items (4)
Changing a Semantics: Opportunism or Courage? ⋮ Unnamed Item ⋮ Sahlqvist correspondence for modal mu-calculus ⋮ Preservation of Sahlqvist fixed point equations in completions of relativized fixed point Boolean algebras with operators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sahlqvist correspondence for modal mu-calculus
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
- Completeness for flat modal fixpoint logics
- Duality and the completeness of the modal \(\mu\)-calculus
- Results on the propositional \(\mu\)-calculus
- Completions of \(\mu \)-algebras
- Topology and duality in modal logic
- Duality for modal \(\mu\)-logics
- Preservation of Sahlqvist fixed point equations in completions of relativized fixed point Boolean algebras with operators
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Modal frame correspondences and fixed-points
- Elementary canonical formulae: extending Sahlqvist's theorem
- Vietoris Bisimulations
- An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
- A new proof of Sahlqvist's theorem on modal definability and completeness
- Minimal predicates, fixed-points, and definability
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication: Sahlqvist theorem for modal fixed point logic
