SELECTION THEOREMS AND TREEABILITY
SELECTION THEOREMS AND TREEABILITY
复制标题
选择定理和可树性
DOI：
10.1090/s0002-9939-08-09548-8
复制
发表时间：
2008
影响因子：
3.9
通讯作者：
G. Hjorth
中科院分区：
文献类型：
--
作者：
G. Hjorth
我们证明了非平凡树的整环有A}个成员.利用这一点，我们表明，光滑树等价关系有博雷尔断面，本质上可数树等价关系有博雷尔完全可数部分。我们还表明，树的等价关系，这是CCC的理想化，测量，或产生的波兰组的博雷尔行动有博雷尔完全可数部分。
We show that domains of non-trivial Σ 1 1 trees have A} members. Using this, we show that smooth treeable equivalence relations have Borel transversals, and essentially countable treeable equivalence relations have Borel complete countable sections. We show also that treeable equivalence relations which are ccc idealistic, measured, or generated by a Borel action of a Polish group have Borel complete countable sections.