Skip to main content Accessibility help

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

  • Alan R. Woods (a1) and Ch. Cornaros (a2)


Over 25 years ago, the first author conjectured in [15] that the existence of arbitrarily large primes is provable from the axioms 0(π) + def(π), where π(x) is the number of primes not exceeding x, 0(π) denotes the theory of Δ0 induction for the language of arithmetic including the new function symbol π, and def(π) is an axiom expressing the usual recursive definition of π. We prove a modified version in which π is replaced by a more general function ξ that counts some of the primes below x (which primes depends on the values of parameters in ξ), and has the property that π is provably Δ0(ξ) definable.



Hide All
[1]Berarducci, A. and Intrigila, B., Combinatorial principles in elementary number theory. Annals of Pure and Applied Logic, vol. 55 (1991), pp. 3550.
[2]Cornaros, Ch., On Grzegorzyk induction, Annals of Pure and Applied Logic, vol. 74 (1995), no. 1. pp. 121.
[3]D'Aquino, P., Local behaviour of the Chebyshev theorem in models of IΔ0, this Journal, vol. 57 (1992), no. 1, pp. 1227.
[4]Grzeoorczyk, A., Some classes of recursive functions, Rozprawy Matematycine, vol. IV (1953). pp. 145.
[5]Nguyen, P., Bounded reverse mathematics, Ph.D. thesis, Graduate Department of Computer Science, University of Toronto, 2008.
[6]Nguyen, P., Proving infinitude of prime numbers using binomial coefficients, preprint, University of Toronto, 2008, pp. 120.
[7]Paris, J. B. and Wilkie, A. J., Counting problems in bounded arithmetic. Methods in Mathematical Logic: Proceedings of the 6th Latin American Symposium on Mathematical Logic 1983, Lecture Notes in Mathematics, vol. 1130, 1985, pp. 317340.
[8]Paris, J. B., Wilkie, A. J., and Woods, A. R., Provability of the pigeonhole principle and the existence of infinitely many primes, this Journal, vol. 53 (1988), pp. 12351244.
[9]Ramanujan, S., A proof of Bertrand's Postulate, Journal of the Indian Mathematical Society, vol. 11 (1919), pp. 181182.
[10]Shapiro, H. N., Introduction to number theory, Wiley-Interscience, New York, 1983.
[11]Sylvester, J. J., On Tchebycheff's theory of the totality of the prime numbers comprised within given limits, American Journal of Mathematics, vol. 4 (1881), pp. 230247, reprinted in The Collected Mathematical Papers of James Joseph Sylvester, vol. 3, 530-545, Chelsea, New York, 1973.
[12]Sylvester, J. J., On arithmetical series. Messenger of Mathematics, vol. 21 (1892), pp. 1-19 and 87120, reprinted in The Collected Mathematical Papers of James Joseph Sylvester, vol. 4, 687–731, Chelsea, New York, 1973.
[13]Tchebychef, P. L., Mémoire sur les nombres premiers, Journal de mathématiques pares et appliquées, I série, vol. 17 (1852), pp. 366390, reprinted in Oeuvres de P. L. Tchebychef, Tome 1, 51–70, Chelsea, New York. A translation into English of part of this work is included in D. E. Smith, A Source Book in Mathematics, 127–148, Dover, New York, 1959.
[14]Wilkie, A. J., Some results and problems on weak systems of arithmetic, Logic Colloquium '77 (Macintyre, A.. Pacholski, L., and Paris, J., editors), North-Holland, 1978, pp. 237248.
[15]Woods, A. R., Some problems in logic and number theory, and their connections, Ph.D. thesis, University of Manchester, 1981.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed