Between Turing and Kleene

DOI10.1007/978-3-030-93100-1_18OpenAlexW4205971086MaRDI QIDQ2151416

Sam Sanders

Publication date: 1 July 2022

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

zbMATH Keywords

Turing machinescomputability theoryKleene S1-S9

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Constructivism in mathematics. An introduction. Volume I
• Reverse mathematics of topology: dimension, paracompactness, and splittings
• Betwixt Turing and Kleene
• Nets and reverse mathematics. Some initial results
• 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
• Bounded variation and the strength of Helly's selection theorem
• Recursive Functionals and Quantifiers of Finite Types I
• Higher-Order Computability
• Infinite time Turing machines
• Nets and reverse mathematics
• 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
• Computational Complexity
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Formal systems for some branches of intuitionistic analysis
• On effectively discontinuous type-2 objects
• Nicht konstruktiv beweisbare Sätze der Analysis
• Nets and Filters in Topology

This page was built for publication: Between Turing and Kleene