Metraipolis › archive › dc_4261ee7db0b9
Coding is non-robust — arXiv:2609.18371
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18371
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T16:14:53.527Z
- SHA-256 of the archived text
5aef2240987130fd96d4b840941bab001c9861c5c56ab8a42d264b62b7349a0b- Stable URL of this page
https://metraipolis.com/documento/dc_4261ee7db0b9
How to cite
Coding is non-robust — arXiv:2609.18371 — arXiv (en), https://arxiv.org/abs/2609.18371 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4261ee7db0b9 (Metraipolis archive dc_4261ee7db0b9, sha256 5aef2240987130fd96d4b840941bab001c9861c5c56ab8a42d264b62b7349a0b)
BibTeX
@misc{dc4261ee7db0b9,
title = {Coding is non-robust — arXiv:2609.18371},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18371},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4261ee7db0b9; sha256 5aef2240987130fd96d4b840941bab001c9861c5c56ab8a42d264b62b7349a0b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18371. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For various reasons, higher-order objects are often studied in mathematical logic via second-order `codes' or `representations'. An important example hailing from real analysis and topology is provided by open sets, which are represented by unions $\cup_{n\in \mathbb{N}}I_{n}$ where each $I_{n}$ is a basic open interval. Now, Montalbán has recently highlighted the importance of robustness of logical systems in Reverse Mathematics (abbreviated RM). It is then a natural RM-question whether basic properties of open sets are robust under slight modifications of the coding of open sets. Here, we study the representation where $I_{n}$ as above is \emph{either} an open interval \emph{or} the union of two such intervals \emph{but} we cannot decide which one. Under this slight variation of the usual coding, basic properties of open and closed sets readily imply the relatively strong system ATR$_{0}$ from RM. Moreover, we obtain equivalences for the former properties and the \emph{enumeration principle}. The latter states that countable sets can be enumerated and boasts many equivalences from Fourier analysis. Along the way, we investigate the RM-properties of the closure, interior, and boundary of sets of reals, a study interesting in its own right.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.LO).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.18371 — 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-15T15:42:36.320Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).