1. M. Davis, Arithmetical problems and recursively enumerable predicates (abstract), Journal of Symbolic Logic vol. 15 (1950) pp. 77-78.
2. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I;Gödel, Kurt;Monatsh. Math. Phys.,1931
3. Recursive predicates and quantifiers;Kleene, S. C.;Trans. Amer. Math. Soc.,1943
4. A. Tarski, A decision method for elementary algebra and geometry, Rand Corporation, Santa Monica, Calif., 1948. Reprinted by the University of California Press, Berkeley, Calif., 1951.