Complexity of codes for Ramsey positive sets
Abstract
Sabok showed that the set of codes for Gδ Ramsey positive subsets of [ω]ω is 12-complete. We extend this result by providing sufficient conditions for the set of codes for Gδ Ramsey positive subsets of an arbitrary topological Ramsey space to be 12-complete.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.