ON THE UNCOUNTABILITY OF

DOI10.1017/jsl.2022.27OpenAlexW4226517410MaRDI QIDQ5052009

Sam Sanders, Dag Normann

Publication date: 18 November 2022

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.07560

zbMATH Keywords

reverse mathematicsKleene S1-S9higher-order computability theoryuncountability of \(\mathbb{R}\)

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items (3)

Banach’s theorem in higher-order reverse mathematics ⋮ The non-normal abyss in Kleene's computability theory ⋮ On the computational properties of the uncountability of the real numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bar recursion over finite partial functions
• The Dirac delta function in two settings of reverse mathematics
• Logical foundations of computer science. International symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10--13, 2022. Proceedings
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Constructivism in mathematics. An introduction. Volume II
• On the strength of König's duality theorem for infinite bipartite graphs
• Vitali's theorem and WWKL
• Functionals of type 3 as realisers of classical theorems in analysis
• Reverse mathematics of topology: dimension, paracompactness, and splittings
• Reverse mathematics of the uncountability of \(\mathbb{R}\)
• Representations and the foundations of mathematics
• Lifting recursive counterexamples to higher-order arithmetic
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Pincherle's theorem in reverse mathematics and computability theory
• The strength of compactness in computability theory and nonstandard analysis
• The Real Numbers
• Basic Real Analysis
• Bounded variation and the strength of Helly's selection theorem
• König's Infinity Lemma and Beth's Tree Theorem
• Monotone Convergence Theorem for the Riemann Integral
• Convexity and Optimization in Banach Spaces
• Excursions in the History of Mathematics
• Uniform versions of some axioms of second order arithmetic
• Recursive Functionals and Quantifiers of Finite Types I
• The countably based functionals
• REVERSE MATHEMATICS OF MF SPACES
• Measure theory and higher order arithmetic
• Higher-Order Computability
• An Introduction to Ramsey Theory
• Georg Cantor and Transcendental Numbers
• THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE
• The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis
• The strength of compactness for countable complete linear orders
• Open sets in computability theory and reverse mathematics
• COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
• On the mathematical and foundational significance of the uncountable
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Reverse Mathematics and Π¹₂ Comprehension
• THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS
• Riemann Integration of Limit Functions
• Arzela's Dominated Convergence Theorem for the Riemann Integral
• An injection from the Baire space to natural numbers
• Variations on a theme by Ishihara
• On Computable Numbers, with an Application to the Entscheidungsproblem
• SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE
• On the computational properties of basic mathematical notions

This page was built for publication: ON THE UNCOUNTABILITY OF