Step By Recursive Step: Church's Analysis Of Effective Calculability

Step By Recursive Step: Church's Analysis Of Effective Calculability (1997)

by Wilfried Sieg

Venue:	BULLETIN OF SYMBOLIC LOGIC
Citations:	7 - 0 self

914	On computable numbers, with an application to the “Entscheidungsproblem – A Turing
214	An unsolvable problem of elementary number theory – A Church - 1936
103	Shadows of the Mind: A Search for the Missing Science of Consciousness – R Penrose - 1996
18	Why Gödel didn’t have Church’s Thesis – M Davis - 1982
95	On formally undecidable propositions of Principia Mathematica and related systems I. Monatshefte für Mathematik und Physik – K Gödel - 1931
61	The Foundations of Mathematics – North Holland Publishing Company, Amsterdam Evert W Beth - 1959
6	Collected Works 1: Philosophy and Foundations of Mathematics – L E J Brouwer - 1975
48	Theory of recursive functions and effective computability. Mc Graw – Hartley Rogers Jr - 1967
9	Frege to Gödel: A source book – From - 1931
16	On the Restricted Ordinal Theorem – R L Goodstein - 1944
6	The future of set theory – Saharon Shelah - 1991
9	What Rests On What? The Proof-Theoretic Analysis Of Mathematics – Solomon Feferman - 1992
9	Extensions of some Theorems of Gödel and Church – J Barkley Rosser - 1936
6	On the Foundations of Logic and Arithmetic – David Hilbert - 1904
5	The Independence of the Continuum Hypothesis II – Paul J Cohen - 1964
5	Comments on Hilbert’s second lecture on the foundations of mathematics – Hermann Weyl - 1927
7	A survey of Mathematical Logic – Hao Wang - 1963
9	Paradox without self-reference – Stephen Yablo - 1993
6	On possibilities in the calculus of relatives – Leopold Löwenheim - 1915