Reverse mathematics of a color basis theorem
Computability · 2025
DOI: 10.1177/22113568241304637 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computability, 2025. Verfasst von Caleb Davis und 4 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben.
Abstract (Originalsprache)
The infinite pigeonhole theorem asserts that if f : N → m is a function with a finite range, then there is a j < m such that the set { n ∈ N ∣ f ( n ) = j } is infinite. This article uses the techniques of reverse mathematics and Weihrauch analysis to examine the strength of a theorem that finds all the values that occur infinitely often in the range of a function.
Zitieren
APA
Davis, C., Hirst, J., Keohulian, S., Miller, B., & Ross, J. (2025). Reverse mathematics of a color basis theorem. Computability. https://doi.org/10.1177/22113568241304637
Vancouver
Davis C, Hirst J, Keohulian S, Miller B, Ross J. Reverse mathematics of a color basis theorem. Computability. 2025. doi:10.1177/22113568241304637
BibTeX
@article{Davis2025,
author = {Davis, Caleb and Hirst, Jeffry and Keohulian, Silva and Miller, Brody and Ross, Jessica},
title = {Reverse mathematics of a color basis theorem},
journal = {Computability},
year = {2025},
doi = {10.1177/22113568241304637}
}
EUVIMED