References

1. J. Corcoran, W. Frank & M. Maloney (1974): String Theory. J. Symb. Log. 39(4), pp. 625–637, doi:10.2307/2272846.
2. 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..
3. D.R. Hofstadter (1979): Gödel, Escher, Bach: An Eternal Golden Braid. Basic Books.
4. J.E. Hopcroft & J.D. Ullman (1979): Introduction to Automata Theory, Languages and Computation. Addison-Wesley.
5. N.D. Jones (1997): Computability and Complexity – From a Programming Perspective. Foundations of computing series. MIT Press.
6. 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.
7. D. Kozen (1997): Automata and Computability. Undergraduate texts in computer science. Springer, doi:10.1007/978-1-4612-1844-9.
8. C.H. Papadimitriou (1994): Computational Complexity. Addison-Wesley.
9. W.V. Quine (1946): Concatenation as a Basis for Arithmetic. J. Symb. Log. 11(4), pp. 105–114, doi:10.2307/2268308. Available at http://projecteuclid.org/euclid.jsl/1183395170.
10. R.M. Robinson (1950): An Essentially Undecidable Axiom System. In: Proceedings of the International Congress of Mathematics 1950, pp. 729–730.
11. J.B. Rosser (1936): Extensions of Some Theorems of Gödel and Church. J. Symb. Log. 1(3), pp. 87–91, doi:10.2307/2269028. Available at http://projecteuclid.org/euclid.jsl/1183142131.
12. A. Tarski, A. Mostowski & R.M. Robinson (1953): Undecidable Theories. North Holland.
13. 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..

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org