Interpretability in Robinson's Q

Bulletin of Symbolic Logic 19 (3):289-317 (2013)
  Copy   BIBTEX

Abstract

Edward Nelson published in 1986 a book defending an extreme formalist view of mathematics according to which there is animpassable barrierin the totality of exponentiation. On the positive side, Nelson embarks on a program of investigating how much mathematics can be interpreted in Raphael Robinson's theory of arithmetic. In the shadow of this program, some very nice logical investigations and results were produced by a number of people, not only regarding what can be interpreted inbut also what cannot be so interpreted. We explain some of these results and rely on them to discuss Nelson's position.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

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

Interpretability in Robinson's Q.Fernando Ferreira & Gilda Ferreira - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
On the untenability of Nelson's predicativism.St Iwan - 2000 - Erkenntnis 53 (1-2):147-154.
Predicative arithmetic.Edward Nelson - 1986 - Princeton, N.J.: Princeton University Press.
Cardinal arithmetic in the style of Baron Von münchhausen.Albert Visser - 2009 - Review of Symbolic Logic 2 (3):570-589.
Weak Theories of Concatenation and Arithmetic.Yoshihiro Horihata - 2012 - Notre Dame Journal of Formal Logic 53 (2):203-222.
Arithmetical set theory.Paul Strauss - 1991 - Studia Logica 50 (2):343 - 350.
Finitistic Arithmetic and Classical Logic.Mihai Ganea - 2014 - Philosophia Mathematica 22 (2):167-197.

Analytics

Added to PP
2016-06-30

Downloads
22 (#166,999)

6 months
2 (#1,816,284)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Systems of predicative analysis.Solomon Feferman - 1964 - Journal of Symbolic Logic 29 (1):1-30.
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1952 - Journal of Symbolic Logic 17 (3):207-207.
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1949 - Journal of Symbolic Logic 14 (3):188-188.

View all 18 references / Add more references