Pages that link to "Item:Q6104376"
From MaRDI portal
The following pages link to The modal mu-calculus alternation hierarchy is strict (Q6104376):
Displaying 14 items.
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
- Measure properties of regular sets of trees (Q2407093) (← 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)
- Measure Properties of Game Tree Languages (Q2922025) (← links)
- On the Weak Index Problem for Game Automata (Q2947463) (← links)
- (Q4381381) (← links)
- (Q4415259) (← links)
- Model checking the full modal mu-calculus for infinite sequential processes (Q4571973) (← links)
- Fixpoint alternation: arithmetic, transition systems, and the binary tree (Q4943547) (← links)
- (Q5014446) (← links)
- (Q5014447) (← links)
- (Q5015272) (← links)