ON THE COMPLEXITY OF BOREL EQUIVALENCE RELATIONS WITH SOME COUNTABILITY PROPERTY

被引:1
|
作者
Lecomte, Dominique [1 ,2 ,3 ]
机构
[1] Sorbonne Univ, CNRS, Inst Math Jussieu Paris Rive Gauche, IMJ PRG, F-75005 Paris, France
[2] Univ Paris, IMJ PRG, F-75013 Paris, France
[3] Univ Picardie, IUT Oise, Site Creil,12 Allee Faiencerie, F-60100 Creil, France
关键词
Borel class; Borel equivalence relation; descriptive complexity; Borel reducibiity; continuous reducibility; dichotomy;
D O I
10.1090/tran/7942
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study the class of Borel equivalence relations under continuous reducibility. In particular, we characterize when a Borel equivalence relation with countable equivalence classes is E-xi(0) (or Pi(0)(xi)). We characterize when all the equivalence classes of such a relation are E-xi(0) (or Pi(0)(xi)). We prove analogous results for the Borel equivalence relations with countably many equivalence classes. We also completely solve these two problems for the first two ranks. In order to do this, we prove some extensions of the Louveau-Saint Raymond theorem, which itself generalized the Hurewicz theorem characterizing when a Borel subset of a Polish space is G(delta).
引用
收藏
页码:1845 / 1883
页数:39
相关论文
共 50 条