Reverse mathematics, countable and uncountable: a computational approach
Abstract Reverse mathematics analyzes the complexity of mathematical statements in terms of the strength of axiomatic systems needed to prove them. Its setting is countable mathematics and subsystems of second order arithmetic. We present a similar analysis based on (recursion-theoretic) computation...
Gespeichert in:
| Veröffentlicht in: | Effective Mathematics of the Uncountable Jg. Series Number 41; S. 150 - 163 |
|---|---|
| 1. Verfasser: | |
| Format: | Buchkapitel |
| Sprache: | Englisch |
| Veröffentlicht: |
United States
Cambridge University Press
31.10.2013
|
| Schlagworte: | |
| ISBN: | 1107014514, 9781107014510 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Abstract Reverse mathematics analyzes the complexity of mathematical statements in terms of the strength of axiomatic systems needed to prove them. Its setting is countable mathematics and subsystems of second order arithmetic. We present a similar analysis based on (recursion-theoretic) computational complexity instead. In the countable case, this view is implicit in many of results in the area. By making it explicit and precise, we provide an alternate approach to this type of analysis for countable mathematics. It may be more intelligible to some mathematicians in that it replaces logic and proof systems with relative computability. In the uncountable case, second order arithmetic and its proof theory is insufficient for the desired analysis. Our computational approach, however, supplies a ready made paradigm for similar analyses. It can be implemented with any appropriate notion of computation on uncountable sets.§1. Introduction. The enterprise of calibrating the strength of theorems of classical mathematics in terms of the (set existence) axioms needed to prove them, was begun by Harvey Friedman in the 1970s (as in [6] and [7]). It is now called Reverse Mathematics as, to prove that some set of axioms is actually necessary to establish a given theorem, one reverses the standard paradigm by proving that the axioms follow from the theorem (in some weak base theory). The original motivations for the subject were foundational and philosophical. It has become a remarkably fruitful and successful endeavor supplying a framework for both the philosophical questions about existence assumptions and foundational or mathematical ones about construction techniques needed to actually produce the objects that the theorems assert exist. |
|---|---|
| ISBN: | 1107014514 9781107014510 |
| DOI: | 10.1017/CBO9781139028592.009 |