Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1804.07952

Some nonstandard equivalences in Reverse Mathematics

Sam Sanders
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reverse Mathematics (RM) is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson. The aim of RM is finding the minimal axioms needed to prove a theorem of ordinary (i.e. non-set theoretical) mathematics. In the majority of cases, one also obtains an equivalence between the theorem and its minimal axioms. This equivalence is established in a weak logical system called the base theory; four prominent axioms which boast lots of such equivalences are dubbed mathematically natural by Simpson. In this paper, we show that a number of axioms from Nonstandard Analysis are equivalent to theorems of ordinary mathematics not involving Nonstandard Analysis. These equivalences are proved in a weak base theory recently introduced by van den Berg and the author. In particular, our base theories have the first-order strength of elementary function arithmetic, in contrast to the original version of this paper [22]. Our results combined with Simpson's criterion for naturalness suggest the controversial point that Nonstandard Analysis is actually mathematically natural.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Sam Sanders. 2018-04-21. Some nonstandard equivalences in Reverse Mathematics. https://arxiv.org/abs/1804.07952

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗