@inproceedings{b3a41264377d48248c49a09304225c53,

title = "On the expressivity of the modal mu-calculus",

abstract = "We analyse the complexity of the sets of states, in certain classes of infinite systems, that satisfy formulae of the modal mu-calculus. Improving on some of our earlier results, we establish a strong upper bound (namely Δ 2 1). We also establish various lower bounds and restricted upper bounds, incidentally providing another proof that the mu-calculus alternation hierarchy does not collapse at level 2.",

keywords = "descriptive complexity, logic in computer science, verification, temporal logic",

author = "J.C. Bradfield",

year = "1996",

doi = "10.1007/3-540-60922-9_39",

language = "English",

isbn = "978-3-540-60922-3",

volume = "1046",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "477--490",

editor = "Claude Puech and R{\"u}diger Reischuk",

booktitle = "STACS 96",

}