1974. The Design and Analysis of Computer Algroithms. Addison–Wesley., , and
1978. The Design of Well-Structured and Correct Programs. Springer Verlag. and
1975. Relativisations of the P =? NP question. SIAM J. Comput., 4(4):431–442., , and
1988. Structural Complexity I. Springer Verlag., , and
1975. Admissible Sets and Structures. Springer Verlag.
1977. Handbook of Mathematical Logic. North Holland., editor
1980. Computable queries for relational data bases. J. Comput. System Sci., 21:156–178. and
1937. An unsolvable problem of elementary number theory. Amer. J. Math., 58:345–363. Reprinted in Davis (1965).
1971. The complexity of theorem-proving procedures. In Proceedings of the Third ACM Symposium on the Theory of Computing, pp. 151–158, Shaker Heights, Ohio.
2013. Alan Turing. His Work and Impact. Elsevier. and , editors
2013. Computability. Turing, Gödel, Church, and Beyond. MIT Press., , and , editors
1965. The Undecidable. Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Raven Press.
1982. Why Gödel didn't have Church's thesis. Information and Control, 54:3–24.
1977. Inductive schemata and recursively continuous functionals. In Logic Colloquium ’76, pp. 373–392. North Holland.
1998. Turing in the land of 0(z). In Herken (1988), pp. 113–147.
1990. Polymorphic typed λ-calculi in a type-free axiomatic framework. In Logic and Computation, Contemporary Mathematics, volume 104, pp. 101–137.AMS.
1991. Logics for termination and correctness of functional programs. In Logic from Computer Science, pp. 95–127. MSRI Publications, Springer Verlag.
1992. Turing's ‘oracle’: from absolute to relative computability – and back. In The Space of Mathematics, et al., editors, pp. 314–348. de Gruyter.
2015. Theses for computation and recursion on concrete and abstract structures. To appear in Turing's Revolution. The Impact of his Ideas about Computability, and , editors.
1980. General Recursion Theory: An Axiomatic Approach. Springer Verlag.
1974. Generalized Recursion Theory. North Holland. and , editors
1978. Generalized Recursion Theory II. North Holland., , and , editors
1987. Computability Theory, Semantics and Logic Programming. Oxford University Press.
1957. Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem 1944). Proc. Nat. Acad. Sci., 43:236–238.
1971. Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. In Logic Colloquium ’69, pp. 361–389. North Holland.
1980. Church's thesis and principles for mechanisms. In The Kleene Symposium, pp. 123–148. North Holland.
1988. The confluence of ideas in 1936. In Herken (1988), pp. 55-111.
and , editors 2001. Collected Works of A.M. Turing. Mathematical Logic. Elsevier.
1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co.. and
1986. Collected Works Volume I: Publications1926–1936. Oxford University Press.
1990. Collected Works Volume II: Publications1938–1974. Oxford University Press.
1999. Handbook of Computability Theory. Elsevier., editor
1987. Algorithmics: The Spirit of Computing. Addison–Wesley.
1988. The Universal Turing Machine. A Half Century Survey. Oxford University Press., editor
1978. Recursion-Theoretic Hierarchies. Springer Verlag.
1983. Alan Turing: The Enigma. Simon and Shuster.
1977. Recursion in higher types. In: Barwise (1977), pp. 681–737. and
1938. On notation for ordinal numbers. J. Symbolic Logic, 3:150–155.
1952. Introduction to Metamathematics. North Holland.
1959a. Countable functionals. In Constructivity in Mathematics, pp. 81–100. North Holland.
1959b. Recursive functionals and quantifiers of finite types I. Trans. Amer. Math. Soc., 91:1–52.
1981. Origins of recursive function theory. Ann. History Comput., 3:52–67.
1954. The upper semi-lattice of degrees of unsolvability. Ann. Math., 59:379–407. and
1959. Interpretation of analysis by means of constructive functionals of finite types. In Constructivity in Mathematics, pp. 101–128. North Holland.
1971. Some reasons for generalizing recursion theory. In Logic Colloquium ’69, pp. 139–198. North Holland.
1983. Degrees of Unsolvability. Springer Verlag.
1989. Some problems and results in the theory of actually computable functions. In Logic Colloquium ’88, pp. 79–89. North Holland. and
1988. The essence of ML. In Proc. 15th ACM/POPL, pp. 28–46. and
1984. Abstract types have existential type. In Proc. 12th ACM/POPL, pp. 37–51. and
1984. Abstract recursion as a foundation for the theory of algorithms. In Computation and Proof Theory, Lecture Notes in Maths. 1104, pp. 289–364. Springer Verlag.
1989. Classical Recursion Theory. Elsevier.
1990. Logic and Computer Science. Academic Press., editor
1966. Foundations of Recursion Theory. PhD thesis, Stanford University.
1944. Recursively enumerable sets of integers and their decision problems. Bull. Amer. Math. Soc., 50:284–316.
1989. Elements of Functional Programming. Addison–Wesley.
1967. Theory of Recursive Functions and Effective Computability. McGraw– Hill.
1963. Degrees of Unsolvability. Annals of Mathematics Studies volume 55. Princeton University Press.
1990. Higher Recursion Theory. Perspectives in Mathematical Logic. Springer Verlag.
1988. Mechanisms for computing over arbitrary structures. In Herken (1988), pp. 581–601.
1963. Computability of recursive functions. J. ACM10:217– 255. and
1977. a-recursion theory. In Barwise (1977), pp. 653–680.
2008. Church without dogma: xxioms for computability. In New Computational Paradigms, , , , editors, pp. 139–152. Springer Verlag.
1977. Degrees of unsolvability: a survey of results. In Barwise (1977), pp. 631–652.
1961. Theory of Formal Systems. Annals of Mathematics Studies volume 47. Princeton University Press.
1987. Recursively Enumerable Sets and Degrees. Springer Verlag.
1987. Reflections on Mechanism. PhD thesis, Columbia University.
1977. Aspects of constructive mathematics. In Barwise (1977), pp. 973–1052.
1988. Program Correctness over Abstract Data Types with Error- State Semantics. CWI Monographs volume 6. Centre for Mathematics and Computer Science, Amsterdam. and
1936. On computable numbers with an application to the Entscheidungs problem. Proc. London Math. Soc., 42:230–265. Reprinted in Davis (1965) and Gandy and Yates (2001).
1937. A correction. Proc. London Math. Soc., 43:544–546. Reprinted in Davis (1965) and Gandy and Yates (2001).
1939. Systems of logic based on ordinals. Proc. London Math. Soc., 45:161–228. Reprinted in Davis (1965) and Gandy and Yates (2001).