On the mathematical and foundational significance of the uncountable
Dag Normann, Sam Sanders

TL;DR
This paper explores the logical and computational complexity of fundamental uncountable theorems, revealing their high proof-theoretic strength and implications for foundational mathematics and the development of the gauge integral.
Contribution
It demonstrates that key uncountable theorems require full second-order arithmetic to prove and compute, highlighting their foundational significance and impact on reverse mathematics.
Findings
Proves the lemmas are extremely hard to prove and compute
Shows the lemmas require second-order arithmetic for proofs
Highlights the importance of the Cousin lemma in gauge integrals
Abstract
We study the logical and computational properties of basic theorems of uncountable mathematics, including the Cousin and Lindel\"of lemma published in 1895 and 1903. Historically, these lemmas were among the first formulations of open-cover compactness and the Lindel\"of property, respectively. These notions are of great conceptual importance: the former is commonly viewed as a way of treating uncountable sets like e.g. as 'almost finite', while the latter allows one to treat uncountable sets like e.g. as 'almost countable'. This reduction of the uncountable to the finite/countable turns out to have a considerable logical and computational cost: we show that the aforementioned lemmas, and many related theorems, are extremely hard to prove, while the associated sub-covers are extremely hard to compute. Indeed, in terms of the standard scale (based on comprehension…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
