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 context | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
  Try with proxy. Try with proxy. Try with proxy. |
| Through your library | Configure |
Similar books and articlesClement F. Kent & Bernard R. Hodgson (1989). Extensions of Arithmetic for Proving Termination of Computations. Journal of Symbolic Logic 54 (3):779-794.
Jeremy Avigad & Jeffrey Helzner (2002). Transfer Principles in Nonstandard Intuitionistic Arithmetic. Archive for Mathematical Logic 41 (6):581-602.
Richard Kaye (1991). Model-Theoretic Properties Characterizing Peano Arithmetic. Journal of Symbolic Logic 56 (3):949-963.
Zlatan Damnjanovic (1997). Elementary Realizability. Journal of Philosophical Logic 26 (3):311-339.
B. R. Buckingham (1953). Elementary Arithmetic. Boston, Ginn.
António M. Fernandes & Fernando Ferreira (2002). Groundwork for Weak Analysis. Journal of Symbolic Logic 67 (2):557-578.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads24 ( #51,701 of 549,514 )Recent downloads (6 months)2 ( #37,418 of 549,514 )How can I increase my downloads? |
My notes
Discussion
