Inproceedings: An article in a conference proceedings.
Transfinite extension ot the mu-calculus
Title of the conference
Computer Science Logic : 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005. Proceedings
Springer Berlin / Heidelberg
Lecture Notes in Computer Science
In  Bradfield found a link between finite differences formed by Sigma(2)(0) sets and the mu-arithmetic introduced by Lubarski . 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 E-2(0) 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.
Web of science
Last modification date