Selection theorems and treeability

DOI10.1090/S0002-9939-08-09548-8zbMATH Open1154.03026OpenAlexW2063415448MaRDI QIDQ3533883FDOQ3533883

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

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

zbMATH Keywords

uniformizationBorel equivalence relationsselection theoremtreeable equivalence relations

Mathematics Subject Classification ID

Descriptive set theory (03E15)

Cites Work

• Title not available (Why is that?)
• Descriptive set theory
• New Dichotomies for Borel Equivalence Relations
• Countable sections for locally compact group actions
• 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
• Title not available (Why is that?)
• 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)