On bounded arithmetic augmented by the ability to count certain sets of primes

DOI10.2178/JSL/1243948322MaRDI QIDQ3630574zbMATH OpenOpenAlexFDO

Authors Alan R. Woods, Ch. Cornaros

Publication date 4 June 2009

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1243948322

zbMATH Keywords

approximate logarithmBertrand's postulatebounded arithmeticinfinitude of primes

Mathematics Subject Classification ID

Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Primes (11A41)

Recommendations

• Proving Infinitude of Prime Numbers Using Binomial Coefficients
• The prime number theorem and fragments of PA
• scientific article; zbMATH DE number 3912375
• Math Bite: A Novel Proof of the Infinitude of Primes, Revisited
• Provability of the pigeonhole principle and the existence of infinitely many primes
• Two short proofs of the infinitude of primes
• Some problems in logic and number theory, and their connections
• On Furstenberg's proof of the infinitude of primes
• Sieving for the primes to prove their infinitude
• Two General Results on Intuitionistic Bounded Theories

Cites work

• Combinatorial principles in elementary number theory
• On Grzegorczyk induction
• Provability of the pigeonhole principle and the existence of infinitely many primes

Cited in

(2)

• Proving Infinitude of Prime Numbers Using Binomial Coefficients
• Provability of the pigeonhole principle and the existence of infinitely many primes

This page was built for publication: On bounded arithmetic augmented by the ability to count certain sets of primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630574)