# Computational reverse mathematics and foundational analysis

**Abstract**

Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbertâ€™s program due to Simpson [1988], and predicativism in the extended form due to Feferman and SchÃ¼tte.
Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only omega-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a Pi-1-1 complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than Pi-1-1-CA0.

**Keywords**

**Categories**

(categorize this paper)

**Reprint years**

2018

**PhilPapers/Archive ID**

EASCRM

**Revision history**

Archival date: 2018-07-11

View upload history

View upload history

References found in this work BETA

Set Existence Principles and Closure Conditions: Unravelling the Standard View of Reverse Mathematics.Benedict Eastaugh - 2019 -

*Philosophia Mathematica*27 (2):153-176.Systems of Predicative Analysis.Feferman, Solomon

Fragments of Arithmetic.Sieg, Wilfried

View all 16 references / Add more references

Citations of this work BETA

No citations found.

**Added to PP index**

2018-07-10

**Total views**

86 ( #34,639 of 48,789 )

**Recent downloads (6 months)**

30 ( #23,480 of 48,789 )

How can I increase my downloads?

**Downloads since first upload**

*This graph includes both downloads from PhilArchive and clicks to external links.*