Reverse Mathematics of the uncountability of
arXiv:2203.05292
Abstract
In his first set theory paper (1874), Cantor establishes the uncountability of . We study the latter in Kohlenbach's higher-order Reverse Mathematics, motivated by the observation that one cannot study concepts like `arbitrary mappings from to ' in second-order Reverse Mathematics. Now, it was recently shown that the following statement: 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 -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.
14 pages, to appear in Springer LNCS, proceedings of CiE2022