Metraipolis › archive › dc_740dbe135bcc
Hagendorf Orders — arXiv:2609.39487
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39487
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:42:22.943Z
- SHA-256 of the archived text
6f9455cb59ba851f9ab562ade14ce9be9de8b6f80ae8c677edef5b4b64814b09- Stable URL of this page
https://metraipolis.com/documento/dc_740dbe135bcc
How to cite
Hagendorf Orders — arXiv:2609.39487 — arXiv (en), https://arxiv.org/abs/2609.39487 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_740dbe135bcc (Metraipolis archive dc_740dbe135bcc, sha256 6f9455cb59ba851f9ab562ade14ce9be9de8b6f80ae8c677edef5b4b64814b09)
BibTeX
@misc{dc740dbe135bcc,
title = {Hagendorf Orders — arXiv:2609.39487},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39487},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_740dbe135bcc; sha256 6f9455cb59ba851f9ab562ade14ce9be9de8b6f80ae8c677edef5b4b64814b09},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39487. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Call a linear order type $\varphi$ Hagendorf if it shares two properties with additively indecomposable ordinal numbers without being one itself: $\varphi$ is strictly indecomposable to the right and whenever $\psi < \varphi$, then $\psi$ can be embedded into a proper initial segment of $\varphi$. In the 1970s, J. Hagendorf asked whether such types exist. F. Galvin observed that they must be uncountable, and soon thereafter, J. Larson proved that they cannot be scattered. We provide a simplification of her argument that might give additional insight into the $\sigma$-scattered case. We then show that consistently Hagendorf types exist and that this holds in many models of set theory, for instance under $\mathsf{BA}$ or $\mathsf{MA}_{\aleph_1}$. In fact, their non-existence has large cardinal strength. Furthermore, we construct real Hagendorf types from $\diamondsuit$ and from $\mathsf{PFA}$. This marks the first progress on this interesting problem since its description by Larson four dozen years ago.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.LO).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.39487 — 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-07T14:16:08.314Z dalla pagina https://arxiv.org/catchup/math.LO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).