Number theory and elementary arithmetic

@article{Avigad2003NumberTA,
  title={Number theory and elementary arithmetic},
  author={Jeremy Avigad},
  journal={Philosophia Mathematica},
  year={2003},
  volume={11},
  pages={257-284}
}
  • J. Avigad
  • Published 1 October 2003
  • Mathematics
  • Philosophia Mathematica
Elementary arithmetic (also known as “elementary function arithmetic”) is a fragment of first-order arithmetic so weak that it cannot prove the totality of an iterated exponential function. Surprisingly, however, the theory turns out to be 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. 
The computational content of classical arithmetic
Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical
Automorphisms of models of bounded arithmetic
We establish the following model theoretic characterization of the fragment I¢0+Exp+B§1 of Peano arithmetic in terms of fixed points of automorphisms of models of bounded arithmetic (the fragment I¢0
The Internal Logic of Constructive Mathematics
Mathematical constructivism could be summarized by the phrase: “Arithmetical statements proven by analytical means can be proven without them, that is by elementary non-analytical means”. Herbrand
FROM BOUNDED ARITHMETIC TO SECOND ORDER ARITHMETIC VIA AUTOMORPHISMS
In this paper we examine the relationship between automorphisms of models of I∆0 (bounded arithmetic) and strong systems of arithmetic, such as PA, ACA0 (arithmetical comprehension schema with
The Computational Content of Classical Arithmetic to Appear in a Festschrift for Grigori Mints
TLDR
Various methods of extracting computational information from proofs in classical first-order arithmetic, and reflects on some of the relationships between them are surveyed.
Proof Theory
Proof theory began in the 1920’s as a part of Hilbert’s program, which aimed to secure the foundations of mathematics by modeling infinitary mathematics with formal axiomatic systems and proving
A formally verified proof of the prime number theorem
TLDR
A formally verified version of Selberg's proof is described, obtained using the Isabelle proof assistant, that asserts that the density of primes in the positive integers is asymptotic to 1/ln x.
Fermat's last theorem and Catalan's conjecture in weak exponential arithmetics
TLDR
It is shown that Fermat's Last Theorem for e is provable (again, under the assumption of ABC in N) in Th(N)+Exp+"coprimality for e" and Catalan's conjecture for e holds in (B,e) and (A,e).
Proof Theory in Philosophy of Mathematics
A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Godel's incompleteness theorems, conservation results, independence results, ordinal
Arithmetization of Logic
Hilbert is not the originator of the expression “metamathematics”, but he is the first to define it as the theory of formal systems designed to capture the internal logic (“inhaltliche Logik”) of
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 135 REFERENCES
The prime number theorem is PRA-provable
  • Olivier Sudac
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2001
TLDR
It is proved that several theories are conservative extensions of primitive recursive arithmetic (PRA) that are rich enough to talk about usual objects of real and complex analysis, and the axioms of which allow to recover a lot of classical results.
Weak Theories of Nonstandard Arithmetic and Analysis
A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative
A Mathematical Incompleteness in Peano Arithmetic
Publisher Summary This chapter investigates a reasonably natural theorem of finitary combinatorics, a simple extension of the Finite Ramsey Theorem. The chapter demonstrates that this theorem, while
Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic
  • J. Avigad
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 1996
TLDR
This method is used to sharpen the conservation theorems of Harrington and Brown-Simpson, giving an effective proof that WKL+0 is conservative over RCA0 with no significant increase in the lengths of proofs.
Metamathematics of First-Order Arithmetic
TLDR
This chapter discusses Arithmetic as Number Theory, Set Theory and Logic, Fragments and Combinatorics, and Models of Fragments of Arithmetic.
A classical introduction to modern number theory
TLDR
This second edition has been corrected and contains two new chapters which provide a complete proof of the Mordell-Weil theorem for elliptic curves over the rational numbers, and an overview of recent progress on the arithmetic of elliptic curve.
An Elementary Proof of Dirichlet's Theorem About Primes in an Arithmetic Progression
1. A classical theorem by Dirichlet asserts that every arithmetic progression ky + 1, where the positive integers k and 1 are relatively prime, represents infinitely many primes as y runs over the
A Feasible Theory for Analysis
TLDR
A weak second-order theory of arithmetic which includes Weak Konig’s Lemma (WKL) for trees defined by bounded formulae is constructed and it is shown that the first-order strength of this version of WKL is exactly that of the scheme of collection for boundedformulae.
Fragments of arithmetic
  • W. Sieg
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 1985
TLDR
By elementary proof-theoretic means the conservativeness of two subsystems of analysis over primitive recursive arithmetic are established, providing a direct finitist justification of the part of mathematical practice formalizable in these subsystems.
Constructivism in Mathematics: An Introduction
7. The Topology of Metric Spaces. 8. Algebra. 9. Finite Type Arithmetic and Theories of Operators. 10. Proof Theory of Intuitionistic Logic. 11. The Theory of Types and Constructive Set Theory. 12.
...
1
2
3
4
5
...