Sahlqvist correspondence for modal mu-calculus

DOI10.1007/s11225-012-9388-9zbMath1404.03021OpenAlexW2117200542MaRDI QIDQ454371

Nick Bezhanishvili, J. F. A. K. van Benthem, I. M. Hodkinson

Publication date: 1 October 2012

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-012-9388-9

zbMATH Keywords

fixed-point logicminimal valuationmodal correspondence theoryPIA formula

Mathematics Subject Classification ID

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

Related Items (9)

Algebraic modal correspondence: Sahlqvist and beyond ⋮ Sahlqvist theorem for modal fixed point logic ⋮ KRULL DIMENSION IN MODAL LOGIC ⋮ Algorithmic correspondence for intuitionistic modal mu-calculus ⋮ Preservation of Sahlqvist fixed point equations in completions of relativized fixed point Boolean algebras with operators ⋮ Algorithmic correspondence and canonicity for non-distributive logics ⋮ The bounded proof property via step algebras and step frames ⋮ Two Logical Faces of Belief Revision ⋮ Unnamed Item

Cites Work

• Sahlqvist theorem for modal fixed point logic
• Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
• Computing circumscription revisited: A reduction algorithm
• Modal frame correspondences and fixed-points
• Elementary canonical formulae: extending Sahlqvist's theorem
• A lattice-theoretical fixpoint theorem and its applications
• A note on modal formulae and relational properties
• A new proof of Sahlqvist's theorem on modal definability and completeness
• Hybrid logics with Sahlqvist axioms
• Minimal predicates, fixed-points, and definability
• The preservation of Sahlqvist equations in completions of Boolean algebras with operators
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sahlqvist correspondence for modal mu-calculus