Reverse formalism 16

Synthese 197 (2):497-544 (2020)
  Copy   BIBTEX


In his remarkable paper Formalism 64, Robinson defends his eponymous position concerning the foundations of mathematics, as follows:Any mention of infinite totalities is literally meaningless.We should act as if infinite totalities really existed. Being the originator of Nonstandard Analysis, it stands to reason that Robinson would have often been faced with the opposing position that ‘some infinite totalities are more meaningful than others’, the textbook example being that of infinitesimals. For instance, Bishop and Connes have made such claims regarding infinitesimals, and Nonstandard Analysis in general, going as far as calling the latter respectively a debasement of meaning and virtual, while accepting as meaningful other infinite totalities and the associated mathematical framework. We shall study the critique of Nonstandard Analysis by Bishop and Connes, and observe that these authors equate ‘meaning’ and ‘computational content’, though their interpretations of said content vary. As we will see, Bishop and Connes claim that the presence of ideal objects in Nonstandard Analysis yields the absence of meaning. We will debunk the Bishop–Connes critique by establishing the contrary, namely that the presence of ideal objects in Nonstandard Analysis yields the ubiquitous presence of computational content. In particular, infinitesimals provide an elegant shorthand for expressing computational content. To this end, we introduce a direct translation between a large class of theorems of Nonstandard Analysis and theorems rich in computational content, similar to the ‘reversals’ from the foundational program Reverse Mathematics. The latter also plays an important role in gauging the scope of this translation.



    Upload a copy of this work     Papers currently archived: 78,059

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Erna and Friedman's reverse mathematics.Sam Sanders - 2011 - Journal of Symbolic Logic 76 (2):637 - 664.
A constructive approach to nonstandard analysis.Erik Palmgren - 1995 - Annals of Pure and Applied Logic 73 (3):297-325.
Reverse-engineering Reverse Mathematics.Sam Sanders - 2013 - Annals of Pure and Applied Logic 164 (5):528-541.
Developments in constructive nonstandard analysis.Erik Palmgren - 1998 - Bulletin of Symbolic Logic 4 (3):233-272.
A Nonstandard Counterpart of WWKL.Stephen G. Simpson & Keita Yokoyama - 2011 - Notre Dame Journal of Formal Logic 52 (3):229-243.
A Nonstandard Delta Function in a Predicative Theory.Peter Zahn - 1995 - Mathematical Logic Quarterly 41 (2):257-260.
A nonstandard proof of a lemma from constructive measure theory.David A. Ross - 2006 - Mathematical Logic Quarterly 52 (5):494-497.
Nonstandard combinatorics.Joram Hirshfeld - 1988 - Studia Logica 47 (3):221 - 232.
Nonstandard arithmetic and recursive comprehension.H. Jerome Keisler - 2010 - Annals of Pure and Applied Logic 161 (8):1047-1062.
Nonstandard analysis and constructivism?Frank Wattenberg - 1988 - Studia Logica 47 (3):303 - 309.
Nonstandard set theory.Peter Fletcher - 1989 - Journal of Symbolic Logic 54 (3):1000-1008.


Added to PP

15 (#708,466)

6 months
2 (#328,161)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Sam Sanders
Ruhr-Universität Bochum

References found in this work

Elements of Intuitionism.Michael Dummett - 1977 - Oxford University Press.
Non-standard Analysis.Gert Heinz Müller - 1966 - Princeton University Press.
Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.

View all 32 references / Add more references