1 M., Ajtai, The complexity of the pigeonhole principle, Combinatorica. An InternationalJournal on Combinatorics and the Theory of Computing, vol. 14 (1994), no. 4, pp. 417–433.Google Scholar

2 A., Adrian Albert, Fundamental concepts of higher algebra, The University of Chicago Press, Chicago, 1958.

3 Alan, Baker, A concise introduction to the theory of numbers, Cambridge University Press, Cambridge, 1984.

4 J.H., Bennett, On spectra, Ph.D.thesis, Princeton University, 1962.

5 Alessandro Berarducci and Paola D'Aquino, Δ0-complexity of the relation y = i≤n F (i), Annals of Pure and Applied Logic, vol. 75 (1995), no. 1–2, pp. 49–56, Proof theory, provability logic, and computation (Berne, 1994.

6 Alessandro, Berarducci and Benedetto, Intrigila, Combinatorial principles in elementarynumber theory, Annals of Pure and Applied Logic, vol. 55 (1991), no. 1, pp. 35–50.

7 Alessandro, Berarducci and MargaritaOtero, A recursive nonstandard model of normalopen induction, The Journal of Symbolic Logic, vol. 61 (1996), no. 4, pp. 1228–1241.

8 Samuel R., Buss, Bounded arithmetic, Bibliopolis, Naples, 1986.

9 Gregory L., Cherlin, Ideals of integers in nonstandard number fields, Model theory andalgebra (A memorial tribute to Abraham Robinson), Springer, Berlin, 1975. pp. 60–90. Lecture Notes inMathematics, Vol. 498.

10 C., Cornaros and C., Dimitracopoulos, The prime number theorem and fragments of PA, Archive for Mathematical Logic, vol. 33 (1994), no. 4, pp. 265–281.Google Scholar

11 PaolaD', Aquino, Local behaviour of the Chebyshev theorem in models of IΔ0, The Journalof Symbolic Logic, vol. 57 (1992), no. 1, pp. 12–27.Google Scholar

12 PaolaD', Aquino, A sharpened version of McAloon's theorem on initial segments of models of IΔ0, Annals of Pure and Applied Logic, vol. 61 (1993), no. 1–2, pp. 49–62, Provability, Interpretability and Arithmetic Symposium (Utrecht, 1991.Google Scholar

13 PaolaD', Aquino, Pell equations and exponentiation in fragments of arithmetic, Annals of Pure andApplied Logic, vol. 77 (1996), no. 1, pp. 1–34.Google Scholar

14 PaolaD', Aquino, Solving Pell equations locally in models of IΔ0, The Journal of Symbolic Logic, vol. 63 (1998), no. 2, pp. 402–410.Google Scholar

15 PaolaD', Aquino, Quotient fields of a model of IΔ0 + Ω1, MLQ Mathematical Logic Quarterly, vol. 47 (2001), no. 3, pp. 305–314.Google Scholar

16 PaolaD', Aquino and AngusMacintyre, Non-standard finite fields over I Δ0+Ω1, IsraelJournal of Mathematics, vol. 117 (2000), pp. 311–333.Google Scholar

17 C., Dimitracopoulos, Matjiasevič theorem and fragments of arithmetic, Ph.D.thesis, Manchester University, 1980.

18 Haim, Gaifman and Constantine, Dimitracopoulos, Fragments of Peano's arithmeticand the MRDP theorem, Logic and Algorithmic Zurich, 1980., Univ. Genève, Geneva, 1982. pp. 187–206.

19 Petr, Hájek and Pavel, Pudlák, Metamathematics of first-order arithmetic, Springer-Verlag, Berlin, 1998. Second printing.

20 G.H., Hardy and E.M., Wright, An introduction to the theory of numbers, fifth ed., The Clarendon Press Oxford University Press, New York, 1979.

21 J.P., Jones and Y.V., atijasevič, Proof of recursive unsolvability of Hilbert's tenth problem, The AmericanMathematical Monthly, vol. 98 (1991), no. 8, pp. 689–709.Google Scholar

22 Richard, Kaye, Diophantine induction, Annals of Pure and Applied Logic, vol. 46 (1990), no. 1, pp. 1–40.Google Scholar

23 Serge, Lang, Algebra, third ed., Springer-Verlag,New York, 2002.

24 H., Lessan,Models of arithmetic, Ph.D.thesis,Manchester University, 1978.

25 Angus, Macintyre, Residue fields of models of p, Logic, methodology and philosophy ofscience, VI Hannover, 1979., North-Holland, Amsterdam, 1982. pp. 193–206.

26 Angus, Macintyre and David, Marker, Primes and their residue rings in models of openinduction, Annals of Pure and Applied Logic, vol. 43 (1989), no. 1, pp. 57–77.Google Scholar

27 Kenneth L., Manders and Leonard, Adleman, NP-complete decision problems for binaryquadratics, Journal of Computer and System Sciences, vol. 16 (1978), no. 2, pp. 168–184.Google Scholar

28 Yu.I., Manin, A course in mathematical logic, Springer-Verlag, New York, 1977. Translated from the Russian by Neal Koblitz, Graduate Texts in Mathematics, Vol. 53.

29 Kenneth, McAloon, On the complexity of models of arithmetic, The Journal of SymbolicLogic, vol. 47 (1982), no. 2, pp. 403–415.Google Scholar

30 Gary L., Miller, Riemann's hypothesis and tests for primality, Seventh annual ACMsymposium on theory of computing (Albuquerque, NM, 1975., Assoc. Comput.Mach., New York, 1975. pp. 234–239.

31 M., Otero, Models of open induction, Ph.D.thesis, Oxford University, 1991.

32 Margarita, Otero, The amalgamation property in normal open induction, Notre DameJournal of Formal Logic, vol. 34 (1993), no. 1, pp. 50–55.Google Scholar

33 Margarita, Otero, The joint embedding property in normal open induction, Annals of Pure andAppliedLogic, vol. 60 (1993), no. 3, pp. 275–290.Google Scholar

34 Margarita, Otero, Quadratic forms in normal open induction, The Journal of Symbolic Logic, vol. 58 (1993), no. 2, pp. 456–476.Google Scholar

35 Rohit, Parikh, Existence and feasibility in arithmetic, The Journal of Symbolic Logic, vol. 36 (1971), pp. 494–508.Google Scholar

36 J., Paris and A., Wilkie, Counting Δ0 sets, Polska Akademia Nauk. Fundamenta Mathematicae, vol. 127 (1987), no. 1, pp. 67–76.Google Scholar

37 J.B., Paris, A.J., Wilkie, and A.R., Woods, Provability of the pigeonhole principle andthe existence of infinitely many primes, The Journal of Symbolic Logic, vol. 53 (1988), no. 4, pp. 1235–1244.Google Scholar

38 Jeff, Paris and Leo, Harrington, Mathematical incompleteness in Peano Arithmetic, Handbook of mathematical logic, North-Holland Publishing Co., Amsterdam, 1977. pp. 1133–1142.

39 Jeff B., Paris and Constantine, Dimitracopoulos, Truth definitions for Δ0 formulae, Logic and algorithmic Zurich, 1980., Univ. Genève, Geneva, 1982. pp. 317–329.

40 Donald, Passman, Permutation groups, W.A., Benjamin, Inc., New York-Amsterdam, 1968.

41 Vaughan R., Pratt, Every prime has a succinct certificate, SIAM Journal on Computing, vol. 4 (1975), no. 3, pp. 214–220.Google Scholar

42 Pavel, Pudlák, A definition of exponentiation by a bounded arithmetical formula, CommentationesMathematicae Universitatis Carolinae, vol. 24 (1983), no. 4, pp. 667–671.Google Scholar

43 J.C., Shepherdson, A non-standard model for a free variable fragment of number theory, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys., vol. 12 (1964), pp. 79–86.Google Scholar

44 Richard, Sommer, Ordinal arithmetic in IΔ0, Arithmetic, proof theory, and computationalcomplexity Prague, 1991., Oxford Univ. Press, New York, 1993. pp. 320–363.

45 Gaisi, Takeuti, Two applications of logic to mathematics, Iwanami ShotenPublishers, Tokyo, 1978. Kanô MemorialLectures,Vol. 3, Publications of the Mathematical Society of Japan, no. 13.

46 Lou van den, Dries, Some model theory and number theory for models of weak systems ofarithmetic, Model theory of algebra and arithmetic (Proc. Conf., Karpacz, 1979., Springer, Berlin, 1980. pp. 346–362.

47 A., Wilkie and J., Paris, On the existence of end extensions of models of bounded induction, Logic, methodology and philosophy of science, VIII(Moscow, 1987., North-Holland,Amsterdam, 1989. pp. 143–161.

48 A.J., Wilkie, Some results and problems on weak systems of arithmetic, Logic Colloquium'77 (Proc. Conf., Wrocław, 1977., North-Holland, Amsterdam, 1978. pp. 285–296.

49 A.J., Wilkie, On discretely ordered rings in which every definable ideal is principal,Model theoryand arithmetic (Paris, 1979–1980), Springer, Berlin, 1981. pp. 297–303.

50 A.J., Wilkie and J.B., Paris, On the scheme of induction for bounded arithmetic formulas, Annals of Pure and Applied Logic, vol. 35 (1987), no. 3, pp. 261–302.Google Scholar

51 A., Woods, Some problems in logic and number theory and their connections, Ph.D.thesis, Manchester University, 1981.

52 A.R., Woods, Algebraic properties of non-standard numbers, Master's thesis, Monash University, 1977.