A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus

DOI10.1109/LICS.2013.54zbMath1366.03186MaRDI QIDQ5271085

Fabio Zanasi, Alessandro Facchini, Yde Venema

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

zbMATH Keywords

modal \(\mu\)-calculuscharacterization resultsweak monadic second-order logicalternating parity automata

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items

Model theory of monadic predicate logic with the infinity quantifier, $$\mu $$ μ -Levels of Interpolation, Unnamed Item