2020/11/03 by Sam Sanders, Sanders, Sam
Computer Science · Mathematics · #03B30 #03D65 #03F35 #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge #Mathematical and Theoretical Analysis
paper · pdf · doi:10.48550/arxiv.2011.02915
openalex publication_date 2020/11/03 · openalex created_date 2020/11/09 · openalex updated_date 2026/07/28
Dag Normann and the author have recently initiated the study of the logical and computational properties of the uncountability of ℝ formalised as the statement \textsfNIN (resp. \textsfNBI that there is no injection (resp. bijection) from [0,1] to ℕ. On one hand, these principles are hard to prove relative to the usual scale based on comprehension and discontinuous functionals. On the other hand, these principles are among the weakest principles on a new complimentary scale based on (classically valid) continuity axioms from Brouwer's intuitionistic mathematics. We continue the study of \textsfNIN and \textsfNBI relative to the latter scale, connecting these principles with theorems about Baire classes, metric spaces, and unordered sums. The importance of the first two topics requires no explanation, while the final topic's main theorem, i.e. that when they exist, unordered sums are (countable) series, has the rather unique property of implying \textsfNIN formulated with the Cauchy criterion, and (only) \textsfNBI when formulated with limits. This study is undertaken within Ulrich Kohlenbach's framework of higher-order Reverse Mathematics.