Pages that link to "Item:Q4943546"
From MaRDI portal
The following pages link to The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees (Q4943546):
Displayed 16 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 equational definition of the least prefixed point. (Q1401250) (← links)
- A gap property of deterministic tree languages. (Q1401364) (← links)
- Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
- Measure Properties of Game Tree Languages (Q2922025) (← 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)
- Domain mu-calculus (Q4460689) (← links)
- Deciding low levels of tree-automata hierarchy (Q4916202) (← links)
- Monadic Second Order Logic And Its Fragments (Q4923546) (← links)
- Fixpoint alternation: arithmetic, transition systems, and the binary tree (Q4943547) (← links)
- On Distributive Fixed-Point Expressions (Q4943552) (← links)