Computer science and the fine structure of Borel sets

Theoretical Computer Science

Volumn 257, Issue 1-2, 2001, Pages 85-105

  Duparc, J ^a   Finkel, O ^a   Ressayre, J P ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; THEOREM PROVING;

BOREL SETS;

SET THEORY;

EID: 0034918301     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00111-0     Document Type: Article

References (29)

1. The monadic second-order logic of graphs IX: Machines and their behaviours
2. The monadic second-order logic of graphs X: Linear orders
3. Wadge hierarchy and Veblen hierarchy: Part I Borel sets of finite rank
4. A normal form for Borel sets of any rank
5. Topological properties of context free ω-languages
6. Locally finite languages
7. Functors and ordinal notations I: A functorial construction of the Veblen hierarchy
8. Some results in the Wadge hierarchy of Borel sets, Cabal Sem 79-81
9. The strength of Borel Wadge determinacy, Cabal Sem 81-85
10. Les propriétés de réduction et de norme pour les classes de Boréliens
11. Borel Determinacy
12. A purely inductive proof of Borel Determinacy
13. Formal languages defined by the underlying structure of their words
14. Stretchings
15. Automata on infinite objects
16. Continuous increasing fonctions of finite and transfinite ordinals
17. Degrees of complexity of subsets of the Baire space
18. On ω-regular sets
19. Pushdown processes: Games and model checking, CAV'96