Algorithmic correspondence for intuitionistic modal mu-calculus

DOI10.1016/j.tcs.2014.10.027zbMath1318.03030OpenAlexW2041784286MaRDI QIDQ483295

Sumit Sourabh, Willem Conradie, Alessandra Palmigiano, Yves Baudelaire Fomatati

Publication date: 16 December 2014

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.027

zbMATH Keywords

intuitionistic logicalgorithmic correspondencemodal mu-calculusSahlqvist correspondence

Mathematics Subject Classification ID

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

Related Items

Linear Logic Properly Displayed, Syntactic Completeness of Proper Display Calculi, Probabilistic Epistemic Updates on Algebras, Algebraic modal correspondence: Sahlqvist and beyond, THE LOGIC OF RESOURCES AND CAPABILITIES, Mu-calculus satisfiability with arithmetic constraints, Algorithmic correspondence and canonicity for non-distributive logics, Unnamed Item, Categories: How I Learned to Stop Worrying and Love Two Sorts, Unnamed Item, Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$

Uses Software

• SQEMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic correspondence and canonicity for distributive modal logic
• Sahlqvist correspondence for modal mu-calculus
• Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
• A Sahlqvist theorem for distributive modal logic
• Results on the propositional \(\mu\)-calculus
• Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. I
• Algebraic modal correspondence: Sahlqvist and beyond
• Unified Correspondence
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Minimal predicates, fixed-points, and definability