Turing's analysis of computability, and major applications of it

[1]  Alan M. Turing,et al.  Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.

[2]  Stephen Cole Kleene,et al.  On notation for ordinal numbers , 1938, Journal of Symbolic Logic.

[3]  S. Kleene.  $\lambda$-definability and recursiveness , 1936 .

[4]  Christopher S. Hill,et al.  Mechanism, Mentalism and Metamathematics , 1980 .

[5]  Martin D. Davis,et al.  Why Gödel Didn't Have Church's Thesis , 1982, Inf. Control..

[6]  Emil L. Post.  Finite combinatory processes—formulation , 1936, Journal of Symbolic Logic.

[7]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[8]  R. Dedekind,et al.  Was sind und was sollen die Zahlen? / von Richard Dedekind , 1888 .

[9]  Robin Gandy,et al.  Church's Thesis and Principles for Mechanisms , 1980 .

[10]  Giuseppe Peano,et al.  Arithmetices Principia Novo Methodo Exposita , 1889 .

[11]  Emil L. Post.  Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.

[12]  Johann A. Makowsky,et al.  Computable Directory Queries , 1986, CAAP.

[13]  J. W. Addison,et al.  Separation principles in the hierarchies of classical and effective descriptive set theory , 1958 .

[14]  D. Hilbert.  Über das Unendliche , 1926 .

[15]  J. Barkley Rosser,et al.  Extensions of some theorems of Gödel and Church , 1936, Journal of Symbolic Logic.

[16]  A. Mostowski.  On definable sets of positive integers , 1947 .

[17]  Stephen Cole Kleene,et al.  Reflections on Church's thesis , 1987, Notre Dame J. Formal Log..

[18]  S. Kleene.  General recursive functions of natural numbers , 1936 .

[19]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[20]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[21]  Martin Davis,et al.  The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions , 2004 .

[22]  R. Peter,et al.  Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion , 1935 .

[23]  Alan M. Turing,et al.  Computability and λ-definability , 1937, Journal of Symbolic Logic.

[24]  S. Kleene.  Recursive predicates and quantifiers , 1943 .

[25]  D. Hofstadter,et al.  Gödel, Escher, Bach: An Eternal Golden Braid@@@Godel, Escher, Bach: An Eternal Golden Braid , 1980 .

[26]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.