The strength of compactness in computability theory and nonstandard analysis

DOI10.1016/j.apal.2019.05.007zbMath1430.03035arXiv1801.08172OpenAlexW2962786850WikidataQ127745937 ScholiaQ127745937MaRDI QIDQ2326415

Dag Normann, Sam Sanders

Publication date: 7 October 2019

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

nonstandard analysisreverse mathematicshigher-order arithmeticfan functionalshigher-order computability theory

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Higher-type and set recursion theory (03D65)

Related Items (13)

ON THE UNCOUNTABILITY OF ⋮ Betwixt Turing and Kleene ⋮ Between Turing and Kleene ⋮ Splittings and disjunctions in reverse mathematics ⋮ Lifting proofs from countable to uncountable mathematics ⋮ On the computational properties of the uncountability of the real numbers ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Pincherle's theorem in reverse mathematics and computability theory ⋮ On the mathematical and foundational significance of the uncountable ⋮ Nets and reverse mathematics ⋮ Measure-theoretic uniformity and the Suslin functional ⋮ The strength of compactness in computability theory and nonstandard analysis ⋮ Splittings and robustness for the Heine-Borel theorem

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
• A nonstandard counterpart of WWKL
• Scenes from the history of real functions. Translated from the Russian by Roger Cooke
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• A functional interpretation for nonstandard arithmetic
• Recursion on the countable functionals
• Refining the taming of the reverse mathematics zoo
• Some nonstandard equivalences in reverse mathematics
• To be or not to be constructive, that is not the question
• Metastability and higher-order computability
• Uniform Heyting 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
• Determinacy in third order arithmetic
• From Nonstandard Analysis to Various Flavours of Computability Theory
• Effective Choice and Boundedness Principles in Computable Analysis
• The limits of determinacy in second-order arithmetic
• Uniform versions of some axioms of second order arithmetic
• Slicing the Truth
• A global solution to the Schrödinger equation: From Henstock to Feynman
• Recursive Functionals and Quantifiers of Finite Types I
• TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS
• Higher-Order Computability
• Internal set theory: A new approach to nonstandard analysis
• Trotter’s limit formula for the Schrödinger equation with singular potential
• The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis
• The Infinite Dimensional Henstock Integral and Problems of Black-Scholes Expectation
• CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
• The unreasonable effectiveness of Nonstandard Analysis
• On the mathematical and foundational significance of the uncountable
• Δ₃^O-determinacy, comprehension and induction
• A NOTE ON THE REVERSE MATHEMATICS OF THE SORITES
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Reverse Mathematics and Π¹₂ Comprehension
• Nonstandard Arithmetic and Reverse Mathematics
• Non-standard analysis
• On uniform weak König's lemma

This page was built for publication: The strength of compactness in computability theory and nonstandard analysis