Metraipolis › archive › dc_91f211129294
$\mathsf{RCA}_0$ Proves the Collapse of the Intersection Principles Hierarchy — arXiv:2611.01571
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01571
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:52:29.994Z
- SHA-256 of the archived text
848653acc3baf1942065e8b01bad8b8f57dfa8306c4a74620612b336fad4505e- Stable URL of this page
https://metraipolis.com/documento/dc_91f211129294
How to cite
$\mathsf{RCA}_0$ Proves the Collapse of the Intersection Principles Hierarchy — arXiv:2611.01571 — arXiv (en), https://arxiv.org/abs/2611.01571 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_91f211129294 (Metraipolis archive dc_91f211129294, sha256 848653acc3baf1942065e8b01bad8b8f57dfa8306c4a74620612b336fad4505e)
BibTeX
@misc{dc91f211129294,
title = {$mathsfRCA_0$ Proves the Collapse of the Intersection Principles Hierarchy — arXiv:2611.01571},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01571},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_91f211129294; sha256 848653acc3baf1942065e8b01bad8b8f57dfa8306c4a74620612b336fad4505e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01571. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper shows that the pairwise intersection principle ($2\mathrm{IP}$) implies, over $\mathsf{RCA}_0$, the existence of a Cohen $1$-generic real relative to every given set. Together with the known implications, this yields the equivalence over $\mathsf{RCA}_0$ of the finite intersection principle (FIP), $2\mathrm{IP}$, and $1$-GEN. In fact, FIP is equivalent to $n\mathrm{IP}$ for every fixed $n\geq 2$. These results give affirmative answers to Questions~1 and~2 of Cholak, Downey, and Igusa, and to Question~9.10.26 of Dzhafarov and Mummert. The proof uses cumulative, nested supports satisfying a finite Helly property and a decoding argument based on a least selected label. Neither $\Sigma^0_2$ induction nor $\Sigma^0_2$ bounding is required.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2611.01571 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:16:07.652Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).