Strictness of the Modal μ-Calculus Hierarchy

DOI10.1007/3-540-36387-4_11zbMath1021.03012OpenAlexW1549281195MaRDI QIDQ4412834

Luca Alberucci

Publication date: 16 July 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36387-4_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Sequent calculi for branching time temporal logics of knowledge and beliefwith awareness: completeness and decidability ⋮ A sequent calculus for logic of knowledge and past time: completeness and decidability ⋮ On modal \(\mu\)-calculus and non-well-founded set theory ⋮ About cut elimination for logics of common knowledge ⋮ Deduction chains for common knowledge ⋮ SMALL INFINITARY EPISTEMIC LOGICS

This page was built for publication: Strictness of the Modal μ-Calculus Hierarchy