- Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.details
|
|
Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.details
|
|
Collected works.Kurt Gödel - 1986 - New York: Oxford University Press. Edited by Solomon Feferman.details
|
|
Axioms of set theory.Joseph R. Shoenfield - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 90.details
|
|
Turing A. M.. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 , pp. 230–265. [REVIEW]Alonzo Church - 1937 - Journal of Symbolic Logic 2 (1):42-43.details
|
|
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.details
|
|
The Logical Foundations of Probability. [REVIEW]Rudolf Carnap - 1950 - Journal of Philosophy 60 (13):362-364.details
|
|
Logical Foundations of Probability.Ernest H. Hutten - 1950 - Journal of Symbolic Logic 16 (3):205-207.details
|
|
Logical Foundations of Probability. [REVIEW]Arthur W. Burks - 1951 - Journal of Philosophy 48 (17):524-535.details
|
|
The Church-Turing Thesis.B. Jack Copeland - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.details
|
|
Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..details
|
|
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.details
|
|
Step by recursive step: Church's analysis of effective calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.details
|
|
Understanding church's thesis.Stewart Shapiro - 1981 - Journal of Philosophical Logic 10 (3):353--65.details
|
|
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.details
|
|
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..details
|
|
Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers.Peter G. Hinman - 1990 - Journal of Symbolic Logic 55 (3):1307-1308.details
|
|
Origins of Recursive Function Theory.Stephen C. Kleene & Martin Davis - 1990 - Journal of Symbolic Logic 55 (1):348-350.details
|
|
β-Recursion Theory.Sy D. Friedman - 1981 - Journal of Symbolic Logic 46 (3):664-665.details
|
|
Models of computation and formal languages.Ralph Gregory Taylor - 1998 - New York: Oxford University Press.details
|
|
Logical Foundations of Probability.Rudolf Carnap - 1950 - Mind 62 (245):86-99.details
|
|
Church's Thesis and Principles for Mechanisms.Robin Gandy - 1980 - In The Kleene Symposium. North-Holland. pp. 123--148.details
|
|
Metamathematics of comparability.Harvey Friedman - manuscriptdetails
|
|
Informal Rigour and Completeness Proofs.Georg Kreisel - 1967 - In Imre Lakatos (ed.), Problems in the Philosophy of Mathematics. North-Holland. pp. 138--157.details
|
|
Mechanical procedures and mathematical experience.Wilfried Sieg - 1994 - In Alexander George (ed.), Mathematics and Mind. Oxford University Press. pp. 71--117.details
|
|
K-Graph Machines: Generalizing Turing's Machines and Arguments.Wilfried Sieg & John Byrnes - unknowndetails
|
|