\(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)

DOI10.1007/978-3-319-58741-7_28zbMath1496.03084arXiv1703.03239OpenAlexW2612335032MaRDI QIDQ2011666

Karoliina Lehtinen, Sandra Quickert

Publication date: 4 August 2017

Full work available at URL: https://arxiv.org/abs/1703.03239

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ On the Way to Alternating Weak Automata

Cites Work

• A gap property of deterministic tree languages.
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
• Automata for the modal μ-calculus and related results
• Deciding the topological complexity of Büchi languages *
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
• Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction
• An automata-theoretic approach to branching-time model checking
• Alternating tree automata, parity games, and modal \(\mu\)-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)