The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs

THEORETICAL COMPUTER SCIENCE

We prove that the Alternation Hierarchy of the Modal μ-Calculus is infinite over finite planar graphs

10.1016/j.tcs.2018.04.009

WOS:000437074500003

http://hdl.handle.net/11390/1134879

info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85045848919

http://www.journals.elsevier.com/theoretical-computer-science/

open access