The confluence of ideas in 1936

[1]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[2]  D. Stein Ada, a life and a legacy , 1985 .

[3]  Leopold Löwenheim Über Möglichkeiten im Relativkalkül , 1915 .

[4]  Helmut Schwichtenberg,et al.  Definierbare Funktionen imλ-Kalkül mit Typen , 1975, Archive for Mathematical Logic.

[5]  J. Dawson Discussion on the foundation of mathematics , 1984 .

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

[7]  Wilhelm Ackermann,et al.  Zur Widerspruchsfreiheit der Zahlentheorie , 1940 .

[8]  P. Bernays,et al.  Grundlagen der Mathematik , 1934 .

[9]  H. B. Curry An Analysis of Logical Substitution , 1929 .

[10]  Maxwell Herman Alexander Newman General principles of the design of all-purpose computing machines , 1948, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[11]  S. Feferman Kurt Godel: Conviction and Caution in Philosophy of Science History of Science. , 1984 .

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

[13]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

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

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

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

[17]  Emil L. Post Recursively enumerable sets of positive integers and their decision problems , 1944 .

[18]  Andrew Hodges,et al.  Alan Turing: The Enigma , 1983 .

[19]  M. Schönfinkel Über die Bausteine der mathematischen Logik , 1924 .

[20]  J. Rosser A mathematical logic without variables. II , 1935 .

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

[22]  Charles Babbage On the Mathematical Powers of the Calculating Engine , 1982 .

[23]  Alonzo Church,et al.  The Richard Paradox , 1934 .

[24]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

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

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

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

[28]  Brian Randell,et al.  On Alan Turing and the Origins of Digital Computers , 1972 .

[29]  Charles Babbage,et al.  Charles Babbage and His Calculating Engines: Selected Writings by Charles Babbage and Others , 1962 .

[30]  M. Dehn Über unendliche diskontinuierliche Gruppen , 1911 .

[31]  Douglas R. Hartree,et al.  Calculating Instruments and Machines , 2012 .

[32]  Arthur W. Burks From ENIAC to the Stored-Program Computer: Two Revolutions in Computers , 1978 .

[33]  J. Paris A Mathematical Incompleteness in Peano Arithmetic , 1977 .

[34]  Saul A. Kripke,et al.  Wittgenstein on Rules and Private Language. , 1985 .

[35]  Georg Kreisel,et al.  On the interpretation of non-finitist proofs—Part I , 1951, Journal of Symbolic Logic.

[36]  A. Church A Set of Postulates for the Foundation of Logic , 1932 .

[37]  R. Peter,et al.  Konstruktion nichtrekursiver Funktionen , 1935 .

[38]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[39]  S. Kleene,et al.  The Inconsistency of Certain Formal Logics , 1935 .

[40]  J. Neumann Zur Hilbertschen Beweistheorie , 1927 .

[41]  C. Smoryński,et al.  The varieties of arboreal experience , 1982 .

[42]  Some rapidly growing functions , 1980 .

[43]  Emil L. Post Introduction to a General Theory of Elementary Propositions , 1921 .

[44]  Haskell B. Curry Grundlagen der kombinatorischen Logik , 1930 .

[45]  M. H. A. Newman,et al.  Alan Mathison Turing, 1912-1954 , 1955, Biographical Memoirs of Fellows of the Royal Society.

[46]  W. Ackermann Zum Hilbertschen Aufbau der reellen Zahlen , 1928 .

[47]  G. H. Hardy,et al.  I.—MATHEMATICAL PROOF , 1929 .

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

[49]  J. Hyland,et al.  Filter spaces and continuous functionals , 1979 .

[50]  Brian Randell,et al.  The origins of digital computers: Selected papers , 1975 .

[51]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.

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

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

[54]  J. Rosser A Mathematical Logic Without Variables. I , 1935 .

[55]  R. Peter,et al.  Über die mehrfache Rekursion , 1937 .

[56]  Gordon P. Baker,et al.  Wittgenstein, rules, grammar, and necessity , 1985 .

[57]  Hao Wang,et al.  Some facts about Kurt Gödel , 1981, Journal of Symbolic Logic.

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

[59]  J. Lucas Minds, Machines and Gödel , 1961, Philosophy.

[60]  Henry S. Tropp,et al.  Charles Babbage: Pioneer of the Computer , 1984 .

[61]  D. Hilbert Die logischen Grundlagen der Mathematik , 1922 .

[62]  Emil L. Post Formal Reductions of the General Combinatorial Decision Problem , 1943 .

[63]  K. Schütte Untersuchungen zum Entscheidungsproblem der mathematischen Logik , 1934 .

[64]  H. Bedmann,et al.  Beiträge zur Algebra der Logik, insbesondere zum Entscheidungsproblem , 1922 .

[65]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[66]  J. V. Heijenoort L'oeuvre Logique de Jacques Herbrand et son Contexte Historique , 1982 .

[67]  Jussi KETONENt,et al.  Rapidly growing Ramsey functions , 1981 .

[68]  Haskell B. Curry,et al.  The paradox of Kleene and Rosser , 1941 .

[69]  Hao Wang,et al.  From Mathematics to Philosophy. , 1975 .

[70]  S. Kleene A Theory of Positive Integers in Formal Logic. Part II , 1935 .

[71]  A. Church,et al.  A Proof of Freedom from Contradiction. , 1935, Proceedings of the National Academy of Sciences of the United States of America.