The modal mu-calculus alternation hierarchy is strict
From MaRDI portal
(Redirected from Publication:1276239)
Recommendations
Cites work
- scientific article; zbMATH DE number 3960988 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 3497881 (Why is no real title available?)
- scientific article; zbMATH DE number 2102739 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- scientific article; zbMATH DE number 4189200 (Why is no real title available?)
- μ-definable sets of integers
- A finite model theorem for the propositional \(\mu\)-calculus
- An automata theoretic decision procedure for the propositional mu- calculus
- An improved algorithm for the evaluation of fixpoint expressions
- Elementary induction on abstract structures
- On modal mu-calculus and Büchi tree automata
- On model checking for the -calculus and its fragments
- On the expressivity of the modal mu-calculus
- Programming languages and their definition. Selected papers ed. by C. B. Jones
- Results on the propositional \(\mu\)-calculus
- The modal mu-calculus alternation hierarchy is strict
Cited in
(40)- Mu-depth 3 is more than 2: A game-theoretic proof
- The Descriptive Complexity of Parity Games
- On the universal and existential fragments of the \(\mu\)-calculus
- Automata on infinite trees
- _1 and the modal -calculus
- Model checking the full modal mu-calculus for infinite sequential processes
- Fixed point characterization of infinite behavior of finite-state systems
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
- The descriptive complexity of modal model-checking games
- Higher-order feedback computation
- The mu-calculus and Model Checking
- Fixpoint alternation: arithmetic, transition systems, and the binary tree
- Yet another hierarchy theorem
- Canonical completeness of infinitary \(\mu \)
- On the expressive power of monadic least fixed point logic
- A gap property of deterministic tree languages.
- scientific article; zbMATH DE number 7215285 (Why is no real title available?)
- The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames
- The modal mu-calculus alternation hierarchy is strict
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- On the \(\mu \)-calculus over transitive and finite transitive frames
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- On modal -calculus with explicit interpolants
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
- The alternation hierarchy in fixpoint logic with chop is strict too
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Mu-calculus path checking
- Free -lattices
- The modal mu-calculus alternation hierarchy is strict
- On the equational definition of the least prefixed point.
- scientific article; zbMATH DE number 1954388 (Why is no real title available?)
- Disjunctive form and the modal alternation hierarchy
- On the Way to Alternating Weak Automata
- The modal -calculus hierarchy over restricted classes of transition systems
- Model checking properties on reduced trace systems
- Symbolic model checking in non-Boolean domains
- Ambiguous classes in \(\mu\)-calculi hierarchies
- scientific article; zbMATH DE number 1136070 (Why is no real title available?)
- Deciding low levels of tree-automata hierarchy
- Fixpoints, games and the difference hierarchy
This page was built for publication: The modal mu-calculus alternation hierarchy is strict
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276239)
