1. Lecture Notes in Computer Science;M. Bezem,2005
2. Herbrand, J.: Logical Writings. Warren, D., Goldfarb, D. (eds.), Reidel Publishing Company, Springer, Heidelberg (2006)
3. König, D.: Theorie der endlichen und unendlichen Graphen, Akademische Verlagsgesellschaft. Leipzig (1936) (Translated from German by McCoart, R., Theory of finite and infinite graphs, Birkhauser (1990))
4. Minsky, M.L.: Recursive unsolvability of Post’s problem of ‘tag’ and other topics in theory of Turing machines. Annals of Mathematics 74(3), 437–455 (1961)
5. Skolem, T.: Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit und Beweisbarkeit mathematischen Sätze nebst einem Theoreme über dichte Mengen. Skrifter I, vol. 4, pp. 1–36, Det Norske Videnskaps-Akademi (1920) (also in Fenstad, J.E. (ed.), Selected Works in Logic by Th. Skolem, pp. 103–136, Universitetsforlaget, Oslo (1970))