COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
From MaRDI portal
Publication:5207560
DOI10.1017/jsl.2019.69zbMath1454.03018arXiv1702.06556OpenAlexW3102702461MaRDI QIDQ5207560
Publication date: 10 January 2020
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.06556
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Nonstandard models in mathematics (03H05) Higher-type and set recursion theory (03D65)
Related Items
Representations and the foundations of mathematics, ON THE UNCOUNTABILITY OF, Betwixt Turing and Kleene, Between Turing and Kleene, Splittings and disjunctions in reverse mathematics, On the computational properties of the uncountability of the real numbers, Unnamed Item, A note on non-classical nonstandard arithmetic, Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017, Reverse mathematics of topology: dimension, paracompactness, and splittings, 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
Cites Work
- Nonstandard arithmetic and recursive comprehension
- A nonstandard counterpart of WWKL
- The Dirac delta function in two settings of reverse mathematics
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
- A functional interpretation for nonstandard arithmetic
- Relatively standard elements in Nelson's internal set theory
- Recursion on the countable functionals
- Constructivism in mathematics. An introduction. Volume II
- Refining the taming of the reverse mathematics zoo
- Reverse mathematics and parameter-free transfer
- Functionals of type 3 as realisers of classical theorems in analysis
- 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
- Nonstandard functional interpretations and categorical models
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- The strength of compactness in computability theory and nonstandard analysis
- Nonstandardness and the bounded functional interpretation
- Measure theory and weak König's lemma
- Lowness notions, measure and domination
- From Nonstandard Analysis to Various Flavours of Computability Theory
- Excursions in the History of Mathematics
- Uniform versions of some axioms of second order arithmetic
- Open Questions in Reverse Mathematics
- Recursive Functionals and Quantifiers of Finite Types I
- Hyperarithmetical quantifiers
- Higher-Order Computability
- End Extensions, Conservative Extensions, and the Rudin-Frolik Ordering
- Internal set theory: A new approach to nonstandard analysis
- The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis
- On the logical strengths of partial solutions to mathematical problems
- Reverse mathematics and a Ramsey-type König's Lemma
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
- On the mathematical and foundational significance of the uncountable
- The inconsistency of a Brouwerian continuity principle with the Curry-Howard interpretation
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Reverse Mathematics and Π12 Comprehension
- Nonstandard Arithmetic and Reverse Mathematics
- Recursive Pseudo-Well-Orderings
- Non-standard analysis
- On uniform weak König's lemma
- 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
