- 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
Other Versions
No versions found
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
Interpreting true arithmetic in the theory of the r.e. truth table degrees.André Nies & Richard A. Shore - 1995 - Annals of Pure and Applied Logic 75 (3):269-311.
Mutual Interpretability of Weak Essentially Undecidable Theories.Zlatan Damnjanovic - 2022 - Journal of Symbolic Logic 87 (4):1374-1395.
Tree Theory: Interpretability Between Weak First-Order Theories of Trees.Zlatan Damnjanovic - 2023 - Bulletin of Symbolic Logic 29 (4):465-502.
Groundwork for weak analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.
A Model–Theoretic Approach to Proof Theory.Henryk Kotlarski - 2019 - Cham, Switzerland: Springer Verlag.
The logic of first order intuitionistic type theory with weak sigma- elimination.M. D. G. Swaen - 1991 - Journal of Symbolic Logic 56 (2):467-483.
Uniform versions of some axioms of second order arithmetic.Nobuyuki Sakamoto & Takeshi Yamazaki - 2004 - Mathematical Logic Quarterly 50 (6):587-593.
Uniform versions of some axioms of second order arithmetic.Nobuyuki Sakamoto & Takeshi Yamakazi - 2004 - Mathematical Logic Quarterly 50 (6):587-593.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.
Analytics
Added to PP
2009-01-28
Downloads
198 (#128,386)
6 months
33 (#114,725)
2009-01-28
Downloads
198 (#128,386)
6 months
33 (#114,725)
Historical graph of downloads
Author's Profile
Citations of this work
Szemerédi’s theorem: An exploration of impurity, explanation, and content.Patrick J. Ryan - 2023 - Review of Symbolic Logic 16 (3):700-739.
Hilbert’s Program.Richard Zach - 2012 - In Ed Zalta (ed.), Stanford Encyclopedia of Philosophy. Stanford, CA: Stanford Encyclopedia of Philosophy.
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 - 2002 - In Dale Jacquette (ed.), Philosophy of Logic. Malden, Mass.: North Holland. pp. 411–447.
References found in this work
Does mathematics need new axioms.Solomon Feferman, Harvey M. Friedman, Penelope Maddy & John R. Steel - 1999 - Bulletin of Symbolic Logic 6 (4):401-446.
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-795c5dcc44-qxk2j dc2