Transfinite extension ot the mu-calculus
Details
Serval ID
serval:BIB_069B7A1A708C
Type
Inproceedings: an article in a conference proceedings.
Collection
Publications
Institution
Title
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
Publisher
Springer Berlin / Heidelberg
ISBN
978-3-540-28231-0
978-3-540-31897-2
978-3-540-31897-2
Publication state
Published
Issued date
2005
Peer-reviewed
Oui
Editor
Ong L.
Volume
3634
Series
Lecture Notes in Computer Science
Pages
384-396
Language
english
Abstract
In [1] Bradfield found a link between finite differences formed by Sigma(2)(0) 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 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
Create date
28/01/2008 15:25
Last modification date
20/08/2019 12:28