Pages that link to "Item:Q1276239"

The following pages link to The modal mu-calculus alternation hierarchy is strict (Q1276239):

Displaying 33 items.

• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
• On the \(\mu \)-calculus over transitive and finite transitive frames (Q606994) (← links)
• On the expressive power of monadic least fixed point logic (Q817849) (← links)
• Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
• Mu-calculus path checking (Q1045942) (← links)
• The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
• Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
• On the equational definition of the least prefixed point. (Q1401250) (← links)
• A gap property of deterministic tree languages. (Q1401364) (← links)
• The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142) (← links)
• Model checking properties on reduced trace systems (Q1736621) (← links)
• Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
• Model checking the full modal mu-calculus for infinite sequential processes (Q1960527) (← links)
• Automata on infinite trees (Q2074210) (← links)
• On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
• On modal \(\mu\)-calculus with explicit interpolants (Q2506827) (← links)
• The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
• Mu-depth 3 is more than 2: a game-theoretic proof (Q2719798) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
• (Q3384164) (← links)
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (Q3519517) (← links)
• The Descriptive Complexity of Parity Games (Q3540190) (← links)
• Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← links)
• The modal<i>μ</i>-calculus hierarchy over restricted classes of transition systems (Q3655261) (← links)
• Fixpoints, games and the difference hierarchy (Q4462675) (← links)
• Yet another hierarchy theorem (Q4508250) (← links)
• Deciding low levels of tree-automata hierarchy (Q4916202) (← links)
• Fixpoint alternation: arithmetic, transition systems, and the binary tree (Q4943547) (← links)
• $\aleph_1$ and the modal $\mu$-calculus (Q4972732) (← links)
• On the Way to Alternating Weak Automata (Q5090957) (← links)
• (Q5114824) (← links)
• Free \(\mu\)-lattices (Q5960406) (← links)