Skip to Main content Skip to Navigation
Journal articles

Computer Science and the Fine Structure of Borel Sets

Abstract : I) Wadge defined a natural refinement of the Borel hierarchy, now called the Wadge hierarchy WH. The fundamental properties of WH follow from results of Kuratowski, Martin, Wadge and Louveau. We give a transparent restatement and proof of Wadge's main theorem. Our method is new for it yields a wide and unexpected extension: from Borel sets of reals to a class of natural but non Borel sets of infinite sequences. Wadge's theorem is quite uneffective and our generalization clearly worse in this respect. Yet paradoxically our method is appropriate to effectivize this whole theory in the context discussed below. II) Wagner defined on Büchi automata (accepting words of length omega) a hierarchy and proved for it an effective analog of Wadge's results. We extend Wagner's results to more general kinds of Automata: Counters, Push Down Automata and Büchi Automata reading transfinite words. The notions and methods developed in (I) are quite useful for this extension. And we start to use them in order to look for extensions of the fundamental effective determinacy results of Büchi-Landweber, Rabin; and of Courcelle-Walukiewicz.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Olivier Finkel Connect in order to contact the contributor
Submitted on : Thursday, October 5, 2006 - 9:31:04 AM
Last modification on : Saturday, June 25, 2022 - 8:45:54 PM
Long-term archiving on: : Thursday, September 20, 2012 - 11:15:43 AM


  • HAL Id : hal-00103673, version 1



Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre. Computer Science and the Fine Structure of Borel Sets. Theoretical Computer Science, Elsevier, 2001, 257 (1-2), pp.85-105. ⟨hal-00103673⟩



Record views


Files downloads