The Dyck and the Preiss separation uniformly
DOI10.1016/J.APAL.2018.06.001OpenAlexW2599011735WikidataQ129516390 ScholiaQ129516390MaRDI QIDQ720760FDOQ720760
Authors: Vassilios Gregoriades 
Publication date: 17 July 2018
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.06480
Recommendations
Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Descriptive set theory (03E15) Applications of computability and recursion theory (03D80)
Cites Work
- Title not available (Why is that?)
- Convex sets in linear spaces
- Convex Polytopes
- Descriptive set theory
- Computable operators on regular sets
- Recursive well-orderings
- On the Structure of Finite Level and ω-Decomposable Borel Functions
- Convex sets in linear spaces. III
- Turning Borel sets into clopen sets effectively
- Finite choice, convex choice and finding roots
- The convex generation of convex Borel sets in locally convex spaces
- Decomposing Borel functions using the Shore-Slaman join theorem
- Non-deterministic computation and the Jayne-Rogers theorem
- The Convex Borel Sets in R 3 are Convexly Generated
- The convex generation of convex Borel sets in Banach spaces
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
- Some applications of positive formulas in descriptive set theory and logic
- The Dyck and the Preiss separation uniformly
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)
