English

Splittings and disjunctions in Reverse Mathematics

Logic 2020-10-14 v4

Abstract

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,CA, B, C such that A(BC)A\leftrightarrow (B\wedge C), i.e. AA can be split into two independent (fairly natural) parts BB and CC. As to disjunctions, there are (very few) examples in RM of theorems D,E,FD, E, F such that D(EF)D\leftrightarrow (E\vee F), i.e. DD can be written as the disjunction of two independent (fairly natural) parts EE and FF. By contrast, we show in this paper that there is a plethora of (natural) splittings and disjunctions in Kohlenbach's higher-order RM. Finally, we discuss the role of these results in the grand scheme of things.

Cite

@article{arxiv.1805.11342,
  title  = {Splittings and disjunctions in Reverse Mathematics},
  author = {Sam Sanders},
  journal= {arXiv preprint arXiv:1805.11342},
  year   = {2020}
}

Comments

18 pages, one table, to appear in the Notre Dame Journal for Formal Logic

R2 v1 2026-06-23T02:11:38.561Z