The Dyck and the Preiss separation uniformly

DOI10.1016/J.APAL.2018.06.001OpenAlexW2599011735WikidataQ129516390 ScholiaQ129516390MaRDI QIDQ720760

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

zbMATH Keywords

convex setsconvexly generatedDyck separationpositive setsPreiss separationuniformity function

Mathematics Subject Classification ID

Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Applications of computability and recursion theory (03D80) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Some applications of positive formulas in descriptive set theory and logic

Cites Work

• Unnamed Item
• Unnamed Item
• Convex sets in linear spaces
• Convex sets in linear spaces. III
• Computable operators on regular sets
• Turning Borel sets into clopen sets effectively
• Recursive well-orderings
• Finite choice, convex choice and finding roots
• The convex generation of convex Borel sets in locally convex spaces
• Convex Polytopes
• Decomposing Borel functions using the Shore–Slaman join theorem
• Non-deterministic computation and the Jayne-Rogers Theorem
• On the Structure of Finite Level and ω-Decomposable Borel Functions
• The Convex Borel Sets in R ³ are Convexly Generated
• The convex generation of convex Borel sets in Banach spaces

This page was built for publication: The Dyck and the Preiss separation uniformly