|
1
|
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
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
|
Gödel on Intuition and on Hilbert’s finitism
– W. W. Tait
|
|
5
|
The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program
– Richard Zach
- 2001
|
|
3
|
Gödel’s correspondence on proof theory and constructive mathematics
– W. W. Tait
|
|
|
UNDECIDABLE PROBLEMS: A SAMPLER
– Bjorn Poonen
|
|
10
|
Notions of computability at higher types I
– John Longley
- 2005
|
|
|
Church’s Thesis
– Guram Bezhanishvili
|
|
1
|
Historical Projects in Discrete Mathematics and Computer Science
– Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
|
|
2
|
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
|
|
2
|
Hilbert’s Program Then and Now
– Richard Zach
- 2005
|
|
5
|
Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems
– Keiichirou Kusakari
- 2000
|
|
|
Length Of Polynomial Ascending Chains And Primitive Recursiveness
– Guillermo Moreno Socias, Equipe De Calcul Formel
- 1992
|
|
4
|
"Clarifying the Nature of the Infinite": the development of metamathematics and proof theory
– Jeremy Avigad, Erich H. Reck
- 2001
|
|
3
|
Computability and Incomputability
– Robert I. Soare
|
