First-Order Reasoning and Primitive Recursive Natural Number Notations

Studia Logica 96 (1):49-64 (2010)
  Copy   BIBTEX

Abstract

If the collection of models for the axioms 21 of elementary number theory is enlarged to include not just the " natural numbers " or their non-standard infinitistic extensions but also what are here called "primitive recursive notations", questions arise about the reliability of first-order derivations from 21. In this enlarged set of "models" some derivations usually accepted as "reliable" may be problematic. This paper criticizes two of these derivations which claim, respectively, to establish the totality of exponentiation and to prove Euclid's theorem about the infinity of primes.

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2013-09-30

Downloads
27 (#825,296)

6 months
7 (#706,906)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations