arXiv Analytics

Sign in

arXiv:1805.11342 [math.LO]AbstractReferencesReviewsResources

Splittings and disjunctions in Reverse Mathematics

Sam Sanders

Published 2018-05-29Version 1

Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson and others. The aim of RM is to find the minimal axioms needed to prove a theorem of ordinary, i.e. non-set-theoretic, mathematics. As suggested by the title, this paper deals with two (relatively rare) RM-phenomena, namely splittings and disjunctions. As to splittings, there are some examples in RM of theorems $A, B, C$ such that $A\leftrightarrow (B\wedge C)$, i.e. $A$ can be split into two independent (fairly natural) parts $B$ and $C$. As to disjunctions, there are (very few) examples in RM of theorems $D, E, F$ such that $D\leftrightarrow (E\vee F)$, i.e. $D$ can be written as the disjunction of two independent (fairly natural) parts $E$ and $F$. By contrast, we show in this paper that there is a plethora of (natural) splittings and disjunctions in Kohlenbach's higher-order RM.

Comments: 12 pages, one table
Categories: math.LO
Subjects: 03B30, 03F35
Related articles: Most relevant | Search more
arXiv:2102.04787 [math.LO] (Published 2021-02-09)
On robust theorems due to Bolzano, Weierstrass, and Cantor in Reverse Mathematics
arXiv:1505.01057 [math.LO] (Published 2015-05-05)
The strength of the tree theorem for pairs in reverse mathematics
arXiv:2403.13143 [math.LO] (Published 2024-03-19)
On sequential theorems in Reverse Mathematics