1. Ehrenfeucht, A., Feferman, S.: Representability of recursively enumberable sets in formal theories. Arch. math. Logik5, 37–41 (1960)
2. Robinson, J.: Definability and decision problems in arithmetic. J. Symb. Logic14, 98–114 (1949).
3. Shepherdson, J.C.: Representability of recursively enumerable sets in formal theories. Arch. math. Logik5, 119–127 (1960).
4. Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable theories, p. 53. Amsterdam: North-Holland 1953.
5. Vaught, R.L.: On a theorem of Cobham concerning undecidable theories. In: Nagel, E., Suppes, P., Tarksi, A. (eds.): Logic, Methodology, and Philosophy of Science, p. 18. Proceedings of the 1960 International Congress. Stanford, CA: Stanford University Press 1962.