Duality and the completeness of the modal \(\mu\)-calculus

DOI10.1016/0304-3975(95)00045-XzbMath0872.03010OpenAlexW2080427861MaRDI QIDQ671986

Marta Kwiatkowska, Simon Ambler, Nicholas Measor

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00045-x

zbMATH Keywords

fixed pointsmonotone operatorsproof systemsmodal \(\mu\)-calculuscategory of descriptive modal frames with contractionscategory of modal algebras with homomorphismsfinitary modal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Other algebras related to logic (03G25)

Related Items (7)

Changing a Semantics: Opportunism or Courage? ⋮ Duality for modal \(\mu\)-logics ⋮ On the equational definition of the least prefixed point. ⋮ Sahlqvist theorem for modal fixed point logic ⋮ Unnamed Item ⋮ An approach to infinitary temporal proof theory ⋮ Topologies, Continuity and Bisimulations

Cites Work

• Duality beyond sober spaces: Topological spaces and observation frames
• Results on the propositional \(\mu\)-calculus
• Proof systems for satisfiability in Hennessy-Milner logic with recursion
• Topology and duality in modal logic
• A finite model theorem for the propositional \(\mu\)-calculus
• Fixed point theorems and semantics: A folk tale
• Domain theory in logical form
• An incomplete logic containing S4
• An incompleteness theorem in modal logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Duality and the completeness of the modal \(\mu\)-calculus