Non-standard numbers: a semantic obstacle for modelling arithmetical reasoning

Logic Journal of the IGPL 20 (2):477-485 (2012)
  Copy   BIBTEX

Abstract

The existence of non-standard numbers in first-order arithmetics is a semantic obstacle for modelling our arithmetical skills. This article argues that so far there is no adequate approach to overcome such a semantic obstacle, because we can also find out, and deal with, non-standard elements in Turing machines

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,154

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

Non‐Standard Models of Ordinal Arithmetics.E. A. Sonenberg - 1979 - Mathematical Logic Quarterly 25 (1‐2):5-27.
Non‐Standard Models of Ordinal Arithmetics.E. A. Sonenberg - 1979 - Mathematical Logic Quarterly 25 (1-2):5-27.
Inheritance in semantic networks and default logic.C. Froidevaux & D. Kayser - 1988 - In Philippe Smets (ed.), Non-standard logics for automated reasoning. San Diego: Academic Press. pp. 179--212.
Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
Models of : when two elements are necessarily order automorphic.Saharon Shelah - 2015 - Mathematical Logic Quarterly 61 (6):399-417.
Non‐standard Analysis in WKL 0.Kazuyuki Tanaka - 1997 - Mathematical Logic Quarterly 43 (3):396-400.
Formalizing non-standard arguments in second-order arithmetic.Keita Yokoyama - 2010 - Journal of Symbolic Logic 75 (4):1199-1210.

Analytics

Added to PP
2015-02-04

Downloads
37 (#601,284)

6 months
6 (#827,406)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
What numbers could not be.Paul Benacerraf - 1965 - Philosophical Review 74 (1):47-73.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Computational Structuralism &dagger.Volker Halbach & Leon Horsten - 2005 - Philosophia Mathematica 13 (2):174-186.

View all 8 references / Add more references