The -calculus alternation depth hierarchy is infinite over finite planar graphs

From MaRDI portal
(Redirected from The -calculus alternation depth hierarchy is infinite over finite planar graphs)
The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
















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)