Kurt Gâ€del: On Formally Undecidable Propositions of the Principia Mathematica and Related Systems; On Undecidable Propositions of Formal Mathematical Systems, On Intuitionistic Arithmetic and Number Theory, On the Length of Proofs, Remarks Before the Princeton Bicentennial Conference of Problems in Mathematics
Alonzo Church: An Unsolvable Problem of Elementary Number Theory, A Note on the Entscheidungsproblem
Alan M. Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Systems of Logic Based on Ordinals
J. B. Rosser: An Informal Exposition of Proofs of Gâ€del's Theorem and Church's Theorem, Extensions of Some Theorems of Gâ€del and Church
Stephen C. Kleene: General Recursive Functions of Natural Numbers, Recursive Predicates and Quantifiers
Emil Post: Finite Combinatory Processes, Formulation I; Recursive Unsolvability of a Problem of Thue, Recursively Enumerable Sets of Positive Integers and Their Decision Problems, Absolutely Unsolvable Problems and Relatively Undecidable Propositions-Account of an Anticipation.
Index.