On the computational properties of the uncountability of the real numbers

DOI10.1007/978-3-031-15298-6_23arXiv2206.12721OpenAlexW4283687586MaRDI QIDQ6160755

Sam Sanders

Publication date: 2 June 2023

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Betwixt Turing and Kleene
• Pincherle's theorem in reverse mathematics and computability theory
• The strength of compactness in computability theory and nonstandard analysis
• Recursive Functionals and Quantifiers of Finite Types I
• Higher-Order Computability
• Did the Young Volterra Know about Cantor?
• Georg Cantor and Transcendental Numbers
• Real and Complex Analysis
• The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis
• ON THE UNCOUNTABILITY OF
• Open sets in computability theory and reverse mathematics
• COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
• On the mathematical and foundational significance of the uncountable
• Bounded Variation and Around

This page was built for publication: On the computational properties of the uncountability of the real numbers