- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Number theory and elementary arithmetic
Philosophia Mathematica 11 (3):257-284 (2003)
Abstract
is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical contextAuthor's Profile
Links
PhilArchive
External links
- From the Publisher via CrossRef (no proxy)
- academic.oup.com (no proxy)
- dx.doi.org (no proxy)
- philmat.oxfordjournals.org (no proxy)
- philmat.oxfordjournals.org [2] (no proxy)
- philmat.oxfordjournals.org [3] (no proxy)
- philmat.oxfordjournals.org [4] (no proxy)
- philmat.oxfordjournals.org [5] (no proxy)
- repository.cmu.edu
(no proxy) - repository.cmu.edu [2] (no proxy)
- repository.cmu.edu [3] (no proxy)
- repository.cmu.edu [4] (no proxy)
- repository.cmu.edu [5] (no proxy)
- andrew.cmu.edu (no proxy)
- mendeley.com (no proxy)
- academic.oup.com [2] (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Groundwork for weak analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.
Model-theoretic properties characterizing peano arithmetic.Richard Kaye - 1991 - Journal of Symbolic Logic 56 (3):949-963.
Transfer principles in nonstandard intuitionistic arithmetic.Jeremy Avigad & Jeffrey Helzner - 2002 - Archive for Mathematical Logic 41 (6):581-602.
Extensions of arithmetic for proving termination of computations.Clement F. Kent & Bernard R. Hodgson - 1989 - Journal of Symbolic Logic 54 (3):779-794.
Analytics
Added to PP
2009-01-28
Downloads
142 (#128,099)
6 months
40 (#93,184)
2009-01-28
Downloads
142 (#128,099)
6 months
40 (#93,184)
Historical graph of downloads
Author's Profile
Citations of this work
What does it take to prove fermat's last theorem? Grothendieck and the logic of number theory.Colin McLarty - 2010 - Bulletin of Symbolic Logic 16 (3):359-377.
Hilbert's program then and now.Richard Zach - 2006 - In Dale Jacquette (ed.), Philosophy of Logic. North Holland. pp. 411–447.
Two arguments against the generic multiverse.Toby Meadows - forthcoming - Review of Symbolic Logic:1-33.
Understanding, formal verification, and the philosophy of mathematics.Jeremy Avigad - 2010 - Journal of the Indian Council of Philosophical Research 27:161-197.
References found in this work
Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo