Refining the taming of the reverse mathematics zoo

DOI10.1215/00294527-2018-0015zbMATH Open1455.03015arXiv1602.02270OpenAlexW3100247314WikidataQ129097310 ScholiaQ129097310MaRDI QIDQ1633897FDOQ1633897

Authors: Sam Sanders 

Publication date: 21 December 2018

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

Abstract: Reverse Mathematics is a program in the foundations of mathematics. It provides an elegant classification in which the majority of theorems of ordinary mathematics fall into only five categories, based on the 'Big Five' logical systems. Recently, a lot of effort has been directed towards finding exceptional theorems, i.e. which fall outside the Big Five. The so-called Reverse Mathematics zoo is a collection of such exceptional theorems (and their relations). It was shown in [17] that a number of uniform versions of the zoo-theorems, i.e. where a functional computes the objects stated to exist, fall in the third Big Five category arithmetical comprehension, inside Kohlenbach's higher-order Reverse Mathematics. In this paper, we extend and refine the results from [17]. In particular, we establish analogous results for recent additions to the Reverse Mathematics zoo, thus establishing that the latter disappear at the uniform level. Furthermore, we show that the aforementioned equivalences can be proved using only intuitionistic logic. Perhaps most surprisingly, these explicit equivalences are extracted from nonstandard equivalences in Nelson's internal set theory, and we show that the nonstandard equivalence can be recovered from the explicit ones.

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

Recommendations

• scientific article; zbMATH DE number 3924748
• Equivalence between theorems: the research program of reverse mathematics
• Uniform versions of some axioms of second order arithmetic
• scientific article; zbMATH DE number 2019844
• Set existence principles and closure conditions: unravelling the standard view of reverse mathematics

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)

Cites Work

• Non-standard analysis
• Algorithmic randomness and complexity.
• Subsystems of second order arithmetic
• Title not available (Why is that?)
• Measure theory and weak König's lemma
• On the strength of the finite intersection principle
• Lebesgue Convergence Theorems and Reverse Mathematics
• Constructivism in mathematics. An introduction. Volume II
• Internal set theory: A new approach to nonstandard analysis
• Title not available (Why is that?)
• Open questions in reverse mathematics
• The atomic model theorem and type omitting
• Title not available (Why is that?)
• Comparing DNR and WWKL
• Located sets and reverse mathematics
• Title not available (Why is that?)
• The upper semi-lattice of degrees of recursive unsolvability
• A functional interpretation for nonstandard arithmetic
• Any FIP real computes a 1-generic

Cited In (5)

• Computability theory, nonstandard analysis, and their connections
• The strength of compactness in computability theory and nonstandard analysis
• To be or not to be constructive, that is not the question
• Reverse formalism 16
• On the strength of the finite intersection principle

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633897)