On modal \(\mu \)-calculus and Gödel-Löb logic

DOI10.1007/s11225-009-9170-9zbMath1201.03008OpenAlexW2294372906MaRDI QIDQ1015480

Luca Alberucci, Alessandro Facchini

Publication date: 8 May 2009

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

Full work available at URL: https://boris.unibe.ch/36790/1/11225_2009_Article_9170.pdf

zbMATH Keywords

fixpointmodal \(\mu \)-calculusGödel-Löb logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items

Some modal aspects of XPath ⋮ The Henkin Sentence ⋮ ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH ⋮ The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames ⋮ Maximally permissive controlled system synthesis for non-determinism and modal logic ⋮ Paradoxes of interaction? ⋮ Fixed-Point Elimination in the Intuitionistic Propositional Calculus ⋮ The modalμ-calculus hierarchy over restricted classes of transition systems ⋮ Constructive Modalities with Provability Smack ⋮ Circular proofs for the Gödel-Löb provability logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• An automata theoretic decision procedure for the propositional mu- calculus
• The uniqueness of the fixed-point in every diagonalizable algebra. (The algebraization of the theories which express Theor. VIII.)
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Modal frame correspondences and fixed-points
• A lattice-theoretical fixpoint theorem and its applications
• The modalμ-calculus hierarchy over restricted classes of transition systems
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Alternating tree automata, parity games, and modal \(\mu\)-calculus