The following pages link to (Q4818826):
Displaying 20 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)
- Canonical completeness of infinitary \(\mu \) (Q941442) (← 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)
- Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) (Q2011666) (← links)
- Automata on infinite trees (Q2074210) (← links)
- The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
- A small model theorem for the hybrid -calculus (Q3195619) (← links)
- (Q3384164) (← links)
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (Q3519517) (← links)
- The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees (Q4943546) (← links)
- Fixpoint alternation: arithmetic, transition systems, and the binary tree (Q4943547) (← links)
- On Distributive Fixed-Point Expressions (Q4943552) (← links)
- (Q5014446) (← links)
- Free \(\mu\)-lattices (Q5960406) (← links)
- The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames (Q6160744) (← links)
