Arithmetic and the Incompleteness Theorems (2000)

by Richard W. Kaye

Active Bibliography

4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
JACQUES HERBRAND: LIFE, LOGIC, AND AUTOMATED DEDUCTION – Claus-peter Wirth, Jörg Siekmann, Christoph Benzmüller, Serge Autexier
Hilbert and Set Theory – Burton Dreben , Akihiro Kanamori - 1997
5 The history and concept of computability – Robert I. Soare - 1999
32 Computability and recursion – Robert I. Soare - 1996
5 The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program – Richard Zach - 2001
Gödel on Intuition and on Hilbert’s finitism – W. W. Tait
UNDECIDABLE PROBLEMS: A SAMPLER – Bjorn Poonen
Church’s Thesis – Guram Bezhanishvili
2 Historical Projects in Discrete Mathematics and Computer Science – Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
3 Gödel's Unpublished Papers on Foundations of Mathematics – W. W. Tait
Lambda-Calculus and Functional Programming – Jonathan P. Seldin
Kurt Gödel, `Über formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme I' (1931) – Richard Zach
4 Hilbert’s Program Then and Now – Richard Zach - 2005
Gödel’s Incompleteness Theorems – Guram Bezhanishvili
5 Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems – Keiichirou Kusakari - 2000
2 Length Of Polynomial Ascending Chains And Primitive Recursiveness – Guillermo Moreno Socías - 1992
3 Gödel’s correspondence on proof theory and constructive mathematics – W. W. Tait
Global semantic typing for inductive and coinductive computing – Daniel Leivant