The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs |
scientific article; zbMATH DE number 6890630
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs |
scientific article; zbMATH DE number 6890630 |
Statements
The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (English)
0 references
18 June 2018
0 references
modal \(\mu\)-calculus
0 references
alternation hierarchy
0 references
parity games
0 references
planar graphs
0 references
0 references
