@inproceedings{df7c0f8b0acf438785f01d21677b5584,

title = "Transfinite Extension of the Mu-Calculus",

abstract = "In [1] Bradfield found a link between finite differences formed by Σ 02 sets and the mu-arithmetic introduced by Lubarski [7]. We extend this approach into the transfinite: in allowing countable disjunctions we show that this kind of extended mu-calculus matches neatly to the transfinite difference hierarchy of Σ 02 sets. The difference hierarchy is intimately related to parity games. When passing to infinitely many priorities, it might not longer be true that there is a positional winning strategy. However, if such games are derived from the difference hierarchy, this property still holds true.",

author = "Julian Bradfield and Jacques Duparc and Sandra Quickert",

year = "2005",

doi = "10.1007/11538363_27",

language = "English",

isbn = "978-3-540-28231-0",

volume = "3634",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "384--396",

editor = "Luke Ong",

booktitle = "Computer Science Logic",

}