The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs |
scientific article |
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
