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

DOI10.2178/JSL/1243948322zbMath1174.03026OpenAlexW2071047533MaRDI QIDQ3630574

Alan R. Woods, Ch. Cornaros

Publication date: 4 June 2009

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

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

zbMATH Keywords

bounded arithmeticBertrand's postulateinfinitude of primesapproximate logarithm

Mathematics Subject Classification ID

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

Cites Work

• Combinatorial principles in elementary number theory
• On Grzegorczyk induction
• 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