^_2 is decidable for ^_2

DOI10.1007/978-3-319-58741-7_28zbMATH Open1496.03084arXiv1703.03239OpenAlexW2612335032MaRDI QIDQ2011666FDOQ2011666

Authors: Karoliina Lehtinen, Sandra Quickert 

Publication date: 4 August 2017

Abstract: Given a $P{i}_2^{mu}$ formula of the modal $mu$ calculus, it is decidable whether it is equivalent to a $Sigm{a}_2^{mu}$ formula.

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)

Cites Work

• A gap property of deterministic tree languages.
• An automata-theoretic approach to branching-time model checking
• Alternating tree automata, parity games, and modal \(\mu\)-calculus
• Automata for the modal \(\mu \)-calculus and related results
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
• Deciding the topological complexity of Büchi languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deciding the weak definability of Büchi definable tree languages
• Title not available (Why is that?)
• Rabin-Mostowski index problem: a step beyond deterministic automata
• Deciding the first levels of the modal \(\mu\) alternation hierarchy by formula construction

Cited In (3)

• The descriptive complexity of modal \(\mu\) model-checking games
• Title not available (Why is that?)
• On the Way to Alternating Weak Automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011666)