The prime number theorem and fragments of PA

DOI10.1007/BF01270626zbMath0813.03040DBLPjournals/aml/CornarosD94OpenAlexW2088885554WikidataQ56059243 ScholiaQ56059243MaRDI QIDQ1337499

Costas Dimitracopoulos, Ch. Cornaros

Publication date: 7 June 1995

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01270626

zbMATH Keywords

prime number theoremexponentiationstrong fragment of Peano arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (5)

Proof Theory in Philosophy of Mathematics ⋮ Abelian groups and quadratic residues in weak arithmetic ⋮ Weak forms of the Regularity Principle in the presence of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf {\mathsf {I}{\mathrm{E}}_1}$\end{document} ⋮ On bounded arithmetic augmented by the ability to count certain sets of primes ⋮ HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial principles in elementary number theory
• On some formalized conservation results in arithmetic
• Provability of the pigeonhole principle and the existence of infinitely many primes

This page was built for publication: The prime number theorem and fragments of PA