|
Informatics Report Series
|
|
|
|
|
|
|
|
|
| Title:Transfinite extension of the mu-calculus |
| Authors:
Julian Bradfield
; Jacques Duparc
; Sandra Quickert
|
| Date: 2005 |
| Publication Title:Computer Science Logic 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings |
| Publisher:Springer |
|
Publication Type:Conference Paper
Publication Status:Published
|
|
Volume No:3634
Page Nos:384-396
|
|
DOI:10.1007/11538363_27
ISBN/ISSN:0302-9743
|
- Abstract:
-
In [Bra03] Bradfield found a link between finite differences formed by $\Sigma^0_2$ 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 $\Sigma^0_2$ 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.
- Links To Paper
- 1st Link
- Bibtex format
- @InProceedings{EDI-INF-RR-0885,
- author = {
Julian Bradfield
and Jacques Duparc
and Sandra Quickert
},
- title = {Transfinite extension of the mu-calculus},
- book title = {Computer Science Logic 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings},
- publisher = {Springer},
- year = 2005,
- volume = {3634},
- pages = {384-396},
- doi = {10.1007/11538363_27},
- url = {http://homepages.inf.ed.ac.uk/jcb/Research/csl05b.ps.gz},
- }
|
