Refining the taming of the reverse mathematics zoo

DOI10.1215/00294527-2018-0015zbMath1455.03015arXiv1602.02270OpenAlexW3100247314WikidataQ129097310 ScholiaQ129097310MaRDI QIDQ1633897

Sam Sanders

Publication date: 21 December 2018

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

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

zbMATH Keywords

nonstandard analysishigher-order reverse mathematicsreverse mathematics zoo

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Nonstandard models in mathematics (03H05)

Related Items (4)

To be or not to be constructive, that is not the question ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Reverse formalism 16 ⋮ The strength of compactness in computability theory and nonstandard analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the strength of the finite intersection principle
• A functional interpretation for nonstandard arithmetic
• Constructivism in mathematics. An introduction. Volume II
• Measure theory and weak König's lemma
• The upper semi-lattice of degrees of recursive unsolvability
• Algorithmic Randomness and Complexity
• Open Questions in Reverse Mathematics
• The atomic model theorem and type omitting
• Internal set theory: A new approach to nonstandard analysis
• Lebesgue Convergence Theorems and Reverse Mathematics
• Located sets and reverse mathematics
• Comparing DNR and WWKL
• Any FIP real computes a 1-generic
• Non-standard analysis

This page was built for publication: Refining the taming of the reverse mathematics zoo