@inproceedings{a599d706568c411c918171eea2f95fb8,

title = "Simplifying the modal mu-calculus alternation hierarchy",

abstract = "In [Bra96], the strictness of the modal mu-calculus alternation hierarchy was shown by transferring a hierarchy from arithmetic; the latter was a corollary of a deep and highly technical analysis of [Lub93]. In this paper, we show that the alternation hierarchy in arithmetic can be established by entirely elementary means; further, simple examples of strict alternation depth n formulae can be constructed, which in turn give very simple examples to separate the modal hierarchy. In addition, the winning strategy formulae of parity games are shown to be such examples.",

author = "J.C. Bradfield",

year = "1998",

doi = "10.1007/BFb0028547",

language = "English",

isbn = "978-3-540-64230-5",

volume = "1373",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "39--49",

editor = "Michel Morvan and Christoph Meinel and Daniel Krob",

booktitle = "STACS 98",

}