Recommendations
Cites work
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- Computable operators on regular sets
- Convex Polytopes
- Convex sets in linear spaces
- Convex sets in linear spaces. III
- Decomposing Borel functions using the Shore-Slaman join theorem
- Descriptive set theory
- Finite choice, convex choice and finding roots
- Non-deterministic computation and the Jayne-Rogers theorem
- On the Structure of Finite Level and ω-Decomposable Borel Functions
- Recursive well-orderings
- The Convex Borel Sets in R 3 are Convexly Generated
- The convex generation of convex Borel sets in Banach spaces
- The convex generation of convex Borel sets in locally convex spaces
- Turning Borel sets into clopen sets effectively
Cited in
(6)- Sheaf recursion and a separation theorem
- A Constructive Version of the Lusin Separation Theorem
- Note on pointwise convergence of sequences of analytic sets
- A Remark about Separation of K-Analytic Sets in the Product Spaces
- The Dyck and the Preiss separation uniformly
- Some applications of positive formulas in descriptive set theory and logic
This page was built for publication: The Dyck and the Preiss separation uniformly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q720760)