Metraipolis › archive › dc_2e6a452a1bc2
Comments on Choiceless Chain Conditions — arXiv:2608.26230
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.26230
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T17:10:25.018Z
- SHA-256 of the archived text
2d8349c3f42fe0be3700048e8199495a42a6fdb4b8c66d8836ad829fddf0d3bb- Stable URL of this page
https://metraipolis.com/documento/dc_2e6a452a1bc2
How to cite
Comments on Choiceless Chain Conditions — arXiv:2608.26230 — arXiv (en), https://arxiv.org/abs/2608.26230 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2e6a452a1bc2 (Metraipolis archive dc_2e6a452a1bc2, sha256 2d8349c3f42fe0be3700048e8199495a42a6fdb4b8c66d8836ad829fddf0d3bb)
BibTeX
@misc{dc2e6a452a1bc2,
title = {Comments on Choiceless Chain Conditions — arXiv:2608.26230},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.26230},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2e6a452a1bc2; sha256 2d8349c3f42fe0be3700048e8199495a42a6fdb4b8c66d8836ad829fddf0d3bb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.26230. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In [10] it was suggested that the countable chain condition should be defined in the absence of choice as "every predense set contains a countable predense subset". During his tutorial at the "120 Years of Choice" conference in 2024, Philipp Schlicht remarked that this definition does not have an iteration theorem in $\mathsf{ZF}$. We provide a proof of this claim. Specifically, we show that if every finite support iteration of ccc forcings is again ccc, then the Axiom of Choice for countable families of countable sets must hold. However, we prove that under the assumption of the Principle of Dependent Choice, the finite support iteration of ccc forcings is again ccc. This requires correcting some issues with the definition of properness (and therefore Mekler's definition of ccc) from [1]. We then study Knaster principles and their relations to this version of ccc.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-28 in math.LO).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.26230 — 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-10-17T17:07:06.720Z dalla pagina https://arxiv.org/catchup/math.LO/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).