Selection theorems and treeability

DOI10.1090/S0002-9939-08-09548-8MaRDI QIDQ3533883zbMATH OpenOpenAlexFDO

Authors Greg Hjorth

Publication date 24 October 2008

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0002-9939-08-09548-8

zbMATH Keywords

uniformizationBorel equivalence relationsselection theoremtreeable equivalence relations

Mathematics Subject Classification ID

Descriptive set theory (03E15)

Recommendations

• Essential countability of treeable equivalence relations
• Treeable equivalence relations
• Trees and amenable equivalence relations
• Measure reducibility of countable Borel equivalence relations
• Incomparable treeable equivalence relations

Cites work

• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• Countable sections for locally compact group actions
• Descriptive set theory
• New Dichotomies for Borel Equivalence Relations
• Non-treeability for product group actions

Cited in

(12)

• The graph-theoretic approach to descriptive set theory
• Borel equivalence relations and cardinal algebras
• Orienting Borel graphs
• scientific article; zbMATH DE number 1160335 (Why is no real title available?)
• Ends of graphed equivalence relations. I
• Trees and amenable equivalence relations
• Choice functions and well-orderings over the infinite binary tree
• Dichotomy theorems for families of non-cofinal essential complexity
• Essential countability of treeable equivalence relations
• Weakly pointed trees and partial injections
• Ends of graphed equivalence relations. II
• Selection theorem for systems with inheritance

This page was built for publication: Selection theorems and treeability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533883)