Complexity of codes for Ramsey positive sets

DOI10.1215/00294527-2024-0041MaRDI QIDQ6930126zbMATH OpenFDO

Authors Allison Yi Fang Wang

Publication date 16 September 2025

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-66/issue-3/Complexity-of-Codes-for-Ramsey-Positive-Sets/10.1215/00294527-2024-0041.full

zbMATH Keywords

\( \Sigma_2^1\)-completeRamsey null setRamsey space

Mathematics Subject Classification ID

Descriptive set theory (03E15)

Cites work

• A complexity problem for Borel graphs
• A new class of Ramsey-classification theorems and their application in the Tukey theory of ultrafilters. I
• A new class of Ramsey-classification theorems and their applications in the Tukey theory of ultrafilters. II
• A new proof that analytic sets are Ramsey
• A Partition Theorem for the Infinite Subtrees of a Tree
• Complexity of Ramsey null sets
• Every analytic set is Ramsey
• High dimensional Ellentuck spaces and initial chains in the Tukey structure of non-p-points
• Infinite-dimensional Ellentuck spaces and Ramsey-classification theorems
• Introduction to Ramsey space
• On Homomorphism Graphs
• Some unifying principles in Ramsey theory

This page was built for publication: Complexity of codes for Ramsey positive sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930126)