Sahlqvist theorem for modal fixed point logic

DOI10.1016/J.TCS.2011.11.026zbMATH Open1268.03020OpenAlexW2079922393MaRDI QIDQ418010FDOQ418010

Authors: Nick Bezhanishvili, Ian 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

Recommendations

• Sahlqvist preservation for topological fixed-point logic
• Preservation of Sahlqvist fixed point equations in completions of relativized fixed point Boolean algebras with operators
• Completeness for flat modal fixpoint logics
• A new proof of Sahlqvist's theorem on modal definability and completeness
• Completeness for Flat Modal Fixpoint Logics

zbMATH Keywords

completenesscorrespondencedescriptive framemodal mu-calculus

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Cites Work

• Modal logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
• Title not available (Why is that?)
• Results on the propositional \(\mu\)-calculus
• Title not available (Why is that?)
• Modal frame correspondences and fixed-points
• Elementary canonical formulae: extending Sahlqvist's theorem
• Title not available (Why is that?)
• 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.
• Vietoris bisimulations
• An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
• Title not available (Why is that?)
• Sahlqvist correspondence for modal mu-calculus
• A new proof of Sahlqvist's theorem on modal definability and completeness
• Minimal predicates, fixed-points, and definability
• 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
• Completions of \(\mu \)-algebras

Cited In (9)

• Completeness for Flat Modal Fixpoint Logics
• Sahlqvist correspondence for modal mu-calculus
• A Sahlqvist theorem for relevant modal logics
• Title not available (Why is that?)
• Preservation of Sahlqvist fixed point equations in completions of relativized fixed point Boolean algebras with operators
• Modal frame correspondences and fixed-points
• Axiomatizing fixpoint logics
• Title not available (Why is that?)
• Changing a Semantics: Opportunism or Courage?

This page was built for publication: Sahlqvist theorem for modal fixed point logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418010)