The descriptive complexity of the set of all closed zero-dimensional subsets of a Polish space
From MaRDI portal
(Redirected from Publication:1800219)
Recommendations
- The descriptive complexity of connectedness in Polish spaces
- Descriptive complexity on non-Polish spaces
- scientific article; zbMATH DE number 4003045
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- The descriptive complexity of Helson sets
- A Polish Topology for the Closed Subsets of a Polish Space
- Spaces of compact subsets of zero-dimensional Polish spaces with an everywhere dense set of isolated points
- Polish spaces, computable approximations, and bitopological spaces
- The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
- Descriptive complexity of countable unions of Borel rectangles
Cites work
- Classical hierarchies from a modern standpoint. Part I. C-sets
- Classical hierarchies from a modern standpoint. Part II. R-sets
- Countable dense homogeneous spaces
- Descriptive set theory
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- On isometric embeddings and continuous maps onto the irrationals
- Quasi-bounded trees and analytic inductions
- The Structure of σ-Ideals of Compact Sets
Cited in
(6)- The descriptive complexity of connectedness in Polish spaces
- On the complexity of subspaces of Sω
- On ⅁Γ-complete sets
- The descriptive complexity of the set of all closed zero-dimensional subsets of a Polish space
- Set theory. Abstracts from the workshop held January 12--17, 2025
- Constructing _3⁰ using topologically restrictive countable disjoint unions
This page was built for publication: The descriptive complexity of the set of all closed zero-dimensional subsets of a Polish space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1800219)