Complexity of codes for Ramsey positive sets
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912159459442688 |
|---|---|
| author | Wang, Allison |
| author_facet | Wang, Allison |
| contents | Sabok showed that the set of codes for $G_δ$ Ramsey positive subsets of $[ω]^ω$ is $\mathbfΣ^1_2$-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 $\mathbfΣ^1_2$-complete. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_08575 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Complexity of codes for Ramsey positive sets Wang, Allison Logic 03E15 Sabok showed that the set of codes for $G_δ$ Ramsey positive subsets of $[ω]^ω$ is $\mathbfΣ^1_2$-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 $\mathbfΣ^1_2$-complete. |
| title | Complexity of codes for Ramsey positive sets |
| topic | Logic 03E15 |
| url | https://arxiv.org/abs/2405.08575 |