Selection theorems and treeability
From MaRDI portal
Publication:3533883
Recommendations
Cites work
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)