# The prime number theorem and fragments ofP A

```@article{Cornaros1994ThePN,
title={The prime number theorem and fragments ofP A},
author={Charalampos Cornaros and C. Dimitracopoulos},
journal={Archive for Mathematical Logic},
year={1994},
volume={33},
pages={265-281}
}```
• Published 1994
• Mathematics, Computer Science
• Archive for Mathematical Logic
SummaryWe show that versions of the prime number theorem as well as equivalent statements hold in an arbitrary model ofIΔ0+exp.
13 Citations
A formally verified proof of the prime number theorem
• Computer Science, Mathematics
• TOCL
• 2007
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. Expand
A formally verifled proof of the prime number theorem
• Mathematics
• 2005
The prime number theorem, established by Hadamard and de la Vallee Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1=lnx. Whereas theirExpand
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, ordinalExpand
On Formal Proofs
We address two questions: what is the use of formal proofs? how do we proceed from a formal proof to a computation?
Proving Infinitude of Prime Numbers Using Binomial Coefficients
The theorem that there are arbitrarily large prime numbers can be proved by some "minimal" reasoning using concepts such as (the logarithm) of a binomial coefficient in the theory IΔ 0, and Bertrand's Postulate is proved. Expand
Number theory and elementary arithmetic
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.Expand
Notes on a Formalization of the Prime Number Theorem
The system thereby confirmed that the prime number theorem is a consequence of the axioms of higher-order logic together with an axiom asserting the existence of an infinite set. All told, our numberExpand
Abelian groups and quadratic residues in weak arithmetic
It is shown that the structure theorem for finite abelian groups is provable in S 2 2 + iWPHP( b), and the quadratic reciprocity theorem is proved in the arithmetic theories T 0 2 +Count2(PV ) and I 0 + Count2( 0) with modulo-2 counting principles. Expand
Unprovable Ramsey-type statements reformulated to talk about primes
Let us say that two finite sets of natural numbers are primality-isomorphic if there is a differencepreserving primality-preserving and nonprimality-preserving bijection between them. Let Φ be theExpand
Bounded reverse mathematics
First we provide a unified framework for developing theories of Bounded Arithmetic that are associated with uniform classes inside polytime ( P) in the same way that Buss's theory S12 is associatedExpand