J. Corcoran, W. Frank & M. Maloney (1974):
String Theory.
J. Symb. Log. 39(4),
pp. 625–637,
doi:10.2307/2272846.
K. Gödel (1931):
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.
Monatsh. Math. Phys. 38(1),
pp. 173–198,
doi:10.1007/BF01700692.
In German..
D.R. Hofstadter (1979):
Gödel, Escher, Bach: An Eternal Golden Braid.
Basic Books.
J.E. Hopcroft & J.D. Ullman (1979):
Introduction to Automata Theory, Languages and Computation.
Addison-Wesley.
N.D. Jones (1997):
Computability and Complexity – From a Programming Perspective.
Foundations of computing series.
MIT Press.
S.C. Kleene (1943):
Recursive Predicates and Quantifiers.
Trans. Amer. Math. Soc. 53(1),
pp. 41–73,
doi:10.1090/S0002-9947-1943-0007371-8.
D. Kozen (1997):
Automata and Computability.
Undergraduate texts in computer science.
Springer,
doi:10.1007/978-1-4612-1844-9.
A. Tarski, A. Mostowski & R.M. Robinson (1953):
Undecidable Theories.
North Holland.
A. Turing (1936):
On Computable Numbers, With an Application to the Entscheidungsproblem.
Proceedings of the London Mathematical Society 42,
pp. 230–265.
Correction in 43 (1937), 544–546..