EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

RAMSEY THEORY AND BOUNDING IN ARITHMETIC

PETER CHOLAK

The Bulletin of Symbolic Logic · 16.07.2026 · 1-15

DOI: 10.1017/bsl.2026.10166 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Bulletin of Symbolic Logic, online erschienen am 16.07.2026. Verfasst von PETER CHOLAK. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We investigate the relationship between various versions of Ramsey’s theorem and bounding schemes in a model N $\mathcal {N}$ script upper N of a fragment of arithmetic F $F$ upper F . Our primary objective is to recast and extend the seminal results of Hirst [15] (see Theorem 1) through the modern lens of Weihrauch reducibility. By extracting explicit Weihrauch reductions from classical proofs, we expose the uniform computational content underlying these combinatorial principles, yielding a deeper and more refined understanding of their reverse mathematical strength. Our results, informally stated in our terminology and established inside N $\mathcal {N}$ script upper N , are as follows: The following are equivalent: B Σ 2 0 $\mathrm {B}\Sigma ^0_2$ normal upper B normal upper Sigma 2 Superscript 0 , the statement that the finite union of finite c.e. sets is finite, and the Infinite Pigeonhole Principle (see Theorem 3). We also discuss the Weihrauch relations between these logically equivalent principles (see Section 4). The Infinite Pigeonhole Principle is Weihrauch reducible to RT 2 2 $\mathrm {RT}^2_2$ upper R upper T 2 squared (see Theorem 4). There is also another principle logically equivalent to B Σ 2 0 $\mathrm {B}\Sigma ^0_2$ normal upper B normal upper Sigma 2 Superscript 0 which is Weihrauch reducible to SRT 2 2 $\mathrm {SRT}^2_2$ upper S upper R upper T 2 squared (see Theorem 5). We show that there is a principle which is equivalent to B Σ 3 0 $\mathrm {B}\Sigma ^0_3$ normal upper B normal upper Sigma 3 Superscript 0 (see Theorem 6) and Weihrauch reducible to SRT < ∞ 2 $\mathrm {SRT}^2_{

Zitieren

APA

CHOLAK, P. (2026). RAMSEY THEORY AND BOUNDING IN ARITHMETIC. The Bulletin of Symbolic Logic, 1-15. https://doi.org/10.1017/bsl.2026.10166

Vancouver

CHOLAK P. RAMSEY THEORY AND BOUNDING IN ARITHMETIC. The Bulletin of Symbolic Logic. 2026:1-15. doi:10.1017/bsl.2026.10166

BibTeX
@article{CHOLAK2026,
  author = {CHOLAK, PETER},
  title = {RAMSEY THEORY AND BOUNDING IN ARITHMETIC},
  journal = {The Bulletin of Symbolic Logic},
  year = {2026},
  pages = {1--15},
  doi = {10.1017/bsl.2026.10166}
}
Kostenlos starten →