Betwixt Turing and Kleene

DOI10.1007/978-3-030-93100-1_15OpenAlexW4206767976MaRDI QIDQ2151412

Sam Sanders, Dag Normann

Publication date: 1 July 2022

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

zbMATH Keywords

representationsbounded variationcomputability theoryKleene S1-S9

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (3)

Between Turing and Kleene ⋮ On the computational properties of the uncountability of the real numbers ⋮ Reverse mathematics of the uncountability of \(\mathbb{R}\)

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
• On the rate of convergence of Bernstein polynomials of functions of bounded variation
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Effective Jordan decomposition
• Quasi-continuity
• Highness properties close to PA completeness
• Nets and reverse mathematics. Some initial results
• Constructive continuity of increasing functions
• Reverse mathematics and computability theory of domain theory
• Pincherle's theorem in reverse mathematics and computability theory
• The strength of compactness in computability theory and nonstandard analysis
• Separating sets by cliquish functions
• Omniscience Principles and Functions of Bounded Variation
• Bounded variation and the strength of Helly's selection theorem
• Recursive Functionals and Quantifiers of Finite Types I
• Measure theory and higher order arithmetic
• Higher-Order Computability
• Bounded variation implies regulated: a constructive proof
• A Constructive Look at Functions of Bounded Variation
• Georg Cantor and Transcendental Numbers
• Nets and reverse mathematics
• 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
• Open sets in computability theory and reverse mathematics
• COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
• On the mathematical and foundational significance of the uncountable
• On uniform weak König's lemma

This page was built for publication: Betwixt Turing and Kleene