The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames

DOI10.1007/978-3-031-15298-6_13OpenAlexW4297809221MaRDI QIDQ6160744

Unnamed Author, Kazuyuki Tanaka

Publication date: 2 June 2023

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15298-6_13

zbMATH Keywords

topological modal logicepistemic logic\( \mu \)-calculusfragments of the alternation hierarchy

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Intuitionistic logic and modality via topology
• On the \(\mu \)-calculus over transitive and finite transitive frames
• On modal \(\mu \)-calculus and Gödel-Löb logic
• The modal mu-calculus alternation hierarchy is strict
• Automata, logics, and infinite games. A guide to current research
• A logic for disjunctive ignorance
• The algebra of topology
• Ignorance of ignorance
• We don't know we don't know: asserting ignorance
• The mu-calculus and Model Checking
• The modalμ-calculus hierarchy over restricted classes of transition systems
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• CONTINGENCY AND KNOWING WHETHER
• On modal  -calculus over reflexive symmetric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames