The -calculus alternation depth hierarchy is infinite over finite planar graphs
From MaRDI portal
(Redirected from Publication:1643142)
The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Planar graphs; geometric and topological aspects of graph theory (05C10) Formal languages and automata (68Q45) Games involving graphs (91A43)
Cites work
- Alternating tree automata, parity games, and modal -calculus
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Entanglement and the complexity of directed graphs
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- Modal characterisation theorems over special classes of frames
- Monadic second order logic on tree-like structures
- On modal -calculus over reflexive symmetric graphs
- On the \(\mu \)-calculus over transitive and finite transitive frames
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- On the modal -calculus over finite symmetric graphs
- Propositional dynamic logic of regular programs
- Results on the propositional \(\mu\)-calculus
- The modal -calculus hierarchy over restricted classes of transition systems
- The modal mu-calculus alternation hierarchy is strict
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
Cited in
(2)
This page was built for publication: The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1643142)
