1. [1] Boolos, G. S., J. P. Burgess, and R. C. Jeffrey, Computability and Logic, 4th edition, Cambridge University Press, Cambridge, 2002.
2. [2] D'Aquino, P., "Toward the limits of the Tennenbaum phenomenon", Notre Dame Journal of Formal Logic, vol. 38 (1997), pp. 81--92.
3. [4] Schmerl, J. H., "Recursive models and the divisibility poset", Notre Dame Journal of Formal Logic, vol. 39 (1998), pp. 140--48.
4. [3] Kaye, R., "Tennenbaum's theorem for models of arithmetic", h% ttp://web.mat.bham.ac.uk/R.W.Kaye/papers/tennenbaum/tennenbaum.pdf, 2006.