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 math- ematics, and argue that they are best understood as closure conditions on the powerset of the natural numbers.
Item Type: | Journal article |
---|---|
Form of publication: | Postprint |
Keywords: | reverse mathematics; foundations of mathematics |
Faculties: | Philosophy, Philosophy of Science and Religious Science > Munich Center for Mathematical Philosophy (MCMP) |
Subjects: | 100 Philosophy and Psychology > 160 Logic |
URN: | urn:nbn:de:bvb:19-epub-60469-7 |
ISSN: | 0031-8019 |
Language: | English |
Item ID: | 60469 |
Date Deposited: | 04. Feb 2019, 07:06 |
Last Modified: | 04. Nov 2020, 13:38 |