[1]Bamber, N. and Kotlarski, H., On interstices in countably arithmetically saturated models of Peano Arithmeitc, Mathematical Logic Quarterly, vol. 43 (1997), pp. 525–540.
[2]Barwise, J. and Schlipf, J., On recursively saturated models of arithmetic, Model theory and algebra: a memorial tribute to Abraham Robinson (Saracino, D. H. and Weispfenning, V. B., editors). Lecture notes in mathematics, vol. 498, Springer-Verlag, 1975, pp. 42–55.
[3]Berline, C., McAloon, K., and Ressayre, J. P., Model theory and arithmetic, Lecture notes in mathematics, vol. 890, Springer-Verlag, 1981.
[4]Bigorajska, T., Kotlarski, H., and Schmerl, J. H., On regular interstices in countable arithmetically saturated models of Peano Arithmetic, Fundamenta Mathematicae, vol. 158 (1998), pp. 125–146.
[5]Cholak, P. A., Jockusch, C. G., and Slaman, T. A., On the strength of Ramsey's theorem for pairs, this Journal, vol. 66 (2001), pp. 1–55.
[6]Hirst, J. L., Combinatorics in subsystems of second order arithmetic, Ph.D. thesis, The Pennsylvania State University, 1987.
[7]Kaufmann, M. and Schmerl, J. H., Weak saturation in models of PA, this Journal, vol. 52 (1987), pp. 129–147.
[8]Kaye, R., A Galois correspondence for countable recursively saturated models of Peano's Arithmetic, Automorphisms of first order structures (Kaye, R. and Macpherson, D.. editors), Oxford University Press, 1994, pp. 293–312.
[9]Kaye, R., Kossak, R., and Kotlarski, H., Automorphisms of recursively saturated models of arithmetic. Annals of Pure and Applied Logic, vol. 55 (1991), pp. 67–91.
[10]Kirby, L. A., Ultrafilters and types of models of arithmetic, Annals of Pure and Applied Logic, vol. 27 (1984), pp. 215–252.
[11]Kossak, R., Kotlarski, H., and Schmerl, J. H., On maximal subgroups of the automorphism group of a countable recursively saturated model of PA, Annals of Pure and Applied Logic, vol. 63 (1991), pp. 125–148.
[12]Kossak, R. and Schmerl, J. H., The automorphism group of an arithmetically saturated model of Peano Arithmetic, Journal of the London Mathematical Society, vol. 52 (1995), pp. 235–244.
[13]Lascar, D., The small index property and recursively saturated models of Peano Arithmetic, Automorphisms of first order structures (Kaye, R. and Macpherson, D., editors), Oxford University Press, 1994, pp. 281–292.
[14]Schmerl, J. H., Closed normal subgroup, Mathematical Logic Quarterly, vol. 47 (2001), pp. 489–492.
[15]Schmerl, J. H., Moving intersticial gaps, Mathematical Logic Quarterly, vol. 48 (2002), pp. 283–296.
[16]Scott, D., Algebras of sets binumerable in complete extensions of arithmetic, Recursive function theory (Dekker, J. C. E., editor), American Mathematical Society Proceeding of symposia in pure mathematics, vol. V, 1962, pp. 117–122.
[17]Seetapun, D. and Slaman, T., On the strength of Ramsey's theorem, Notre Dame Journal of Formal Logic, vol. 36 (1995), no. 4, pp. 570–582, Special Issue: Models of arithmetic.
[18]Simpson, S. G., Subsystems of second order aithmetic, Springer-Verlag, 1998.
[19]Smoryński, C., Back and forth inside a recursively saturated model of arithmetic, Logic colloquium '80 (van Dallen, D., editor), North-Holland, 1982, pp. 273–278.
[20]Wilmers, G. M., Unpublished, 1975, D. Phil. Thesis, Oxford University.