Inproceedings: an article in a conference proceedings.
Describing the Wadge Hierarchy for the Alternation Free Fragment of μ -Calculus (I) The Levels Below ω 1
Title of the conference
Logic and Theory of Algorithms : Fourth Conference on Computability in Europe, CiE 2008, Athens, Greece, June 2008, Proceedings
Beckmann A., Dimitracopoulos C., Löwe B.
Lecture Notes in Computer Science
The height of the Wadge Hierarchy for the Alternation Free Fragment of mu-calculus is known to be at least epsilon(0). It was conjectured that the height is exactly epsilon(0). We make a first step towards the proof of this conjecture by showing that there is no Delta(mu)(2) definable set in between the levels omega(omega) and omega(1) of the Wadge Hierarchy of Borel Sets.
μ-calculus, Wadge games, Topological complexity, Parity games, Weakly alternating automata
Web of science
Last modification date