Reverse Mathematics of the uncountability of R
Abstract
In his first set theory paper (1874), Cantor establishes the uncountability of R. We study the latter in Kohlenbach's higher-order Reverse Mathematics, motivated by the observation that one cannot study concepts like `arbitrary mappings from R to N' in second-order Reverse Mathematics. Now, it was recently shown that the following statement: NIN: there is no injection from [0,1] to N, is hard to prove in terms of conventional comprehension. In this paper, we show that NIN is robust by establishing equivalences between NIN and NIN restricted to mainstream function classes, like: bounded variation, semi-continuity, and Borel. Thus, the aforementioned hardness of NIN is not due to the quantification over arbitrary R→ N-functions in NIN. Finally, we also study NBI, the restriction of NIN to bijections, and the connection to Cousin's lemma and Jordan's decomposition theorem.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.