Describing the Wadge Hierarchy for the Alternation Free Fragment of μ -Calculus (I) The Levels Below ω 1
Details
Serval ID
serval:BIB_B7FCE719AFD8
Type
Inproceedings: an article in a conference proceedings.
Collection
Publications
Institution
Title
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
Publisher
Springer
ISBN
978-3-540-69405-2
978-3-540-69407-6
978-3-540-69407-6
Publication state
Published
Issued date
2008
Peer-reviewed
Oui
Editor
Beckmann A., Dimitracopoulos C., Löwe B.
Volume
5028
Series
Lecture Notes in Computer Science
Pages
186-195
Language
english
Abstract
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.
Keywords
μ-calculus, Wadge games, Topological complexity, Parity games, Weakly alternating automata
Web of science
Create date
07/04/2008 15:19
Last modification date
20/08/2019 15:26
Usage data
