On modal \(\mu\)-calculus with explicit interpolants

DOI10.1016/j.jal.2005.06.008zbMath1106.03024OpenAlexW2019301510MaRDI QIDQ2506827

Giovanna D'Agostino, Giacomo Lenzi

Publication date: 10 October 2006

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2005.06.008

zbMATH Keywords

\(\mu\)-calculusuniform interpolationbisimulation quantifier

Mathematics Subject Classification ID

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

Related Items (7)

Knowledge forgetting in propositional \(\mu\)-calculus ⋮ Modalities in the Stone age: a comparison of coalgebraic logics ⋮ Bisimulation quantifiers and uniform interpolation for guarded first order logic ⋮ Equational Coalgebraic Logic ⋮ $$\mu $$ μ -Levels of Interpolation ⋮ A general multi-agent epistemic planner based on higher-order belief change ⋮ Forgetting in multi-agent modal logics

Cites Work

• Unnamed Item
• An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus
• Results on the propositional \(\mu\)-calculus
• The modal mu-calculus alternation hierarchy is strict
• Characterizations of negative definability in modal logic
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Automata for the modal μ-calculus and related results
• A sheaf representation and duality for finitely presented Heyting algebras
• Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
• An automata-theoretic approach to branching-time model checking
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic

This page was built for publication: On modal \(\mu\)-calculus with explicit interpolants