Summary
We show that versions of the prime number theorem as well as equivalent statements hold in an arbitrary model ofIΔ 0+exp.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berarducci A., Intrigila, B.: Combinatorial principles in elementary number theory. Ann. Pure Appl. Logic55, 35–50 (1991)
Clote, P., Hájek P., Paris, J.: On some formalized conservation results in arithmetic. Arch. Math. Logic30, 201–218 (1990)
Cornaros, Ch.: Ph. D. thesis. University of Crete, to appear
Gaifman, H., Dimitracopoulos, C.: Fragments of Peano's arithmetic and the MRDP theorem. Logic and Algorithmic, Monograph. Enseign. Math.30, 187–206 (1982)
Hájek, P., Pudlák, P.: Metamathematics of First-Order Arithmetic. Springer-Verlag, Berlin, 1992
Macintyre, A.J.: The strength of weak systems. In: Proc. 11th Intern. Wittgenstein Symp., Kirchberg/Wechsel, Austria, 1986 (Hölder-Pichler-Tempsky, Vienna, 1987), 43–59
Paris, J., Kirby, L.A.S.:∑ n -Collection schemas in arithmetic. Logic Colloquium '77, North-Holland (1978), 199–209
Paris, J.B., Wilkie, A.J., Woods, A.R.: Provability of the pigeonhole principle and the existence of infinitely many primes. J. Symbolic Logic53, 1235–1244 (1988)
Shapiro, H.N.: Introduction to the theory of numbers. Wiley-Interscience, New York, 1983
Woods, A.R.: Some problems in logic and number theory, and their connections. Ph. D. thesis, University of Manchester, 1981
Author information
Authors and Affiliations
Additional information
A part of the preparation of this paper was done while the authors were visiting the University of Oxford in the spring of 1992; their visit was partially supported by the University of Crete (grant no. 185) and the British Council. The authors thank Drs. R. Kaye and A. Wilkie for useful discussions and the Mathematical Institute of the University of Oxford for their hospitality; they also thank Dr. K. Skandalis for pointing out an error in an earlier proof of Theorem 3.3 and the two referees, for suggesting Lemma 1.13 as a common generalization of some earlier Lemmas and for many other comments, which helped to improve this paper
Rights and permissions
About this article
Cite this article
Cornaros, C., Dimitracopoulos, C. The prime number theorem and fragments ofP A . Arch Math Logic 33, 265–281 (1994). https://doi.org/10.1007/BF01270626
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01270626