Set existence principles and closure conditions: unravelling the standard view of reverse mathematics

TL;DR

This paper examines the role of set existence principles in reverse mathematics, proposing they function as closure conditions on the powerset of natural numbers, and explores their significance in the equivalence of theorems to specific subsystems.

Contribution

It offers a new perspective by interpreting set existence principles as closure conditions, enhancing understanding of their role in reverse mathematics.

Findings

Set existence principles act as closure conditions on the powerset of natural numbers.

Most theorems are equivalent to five key subsystems of second order arithmetic.

This interpretation clarifies the significance of these equivalences in reverse mathematics.

Abstract

It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems. In this article I analyse the role of set existence principles in reverse mathematics, and argue that they are best understood as closure conditions on the powerset of the natural numbers.