|
1
|
Historical Projects in Discrete Mathematics and Computer Science
– Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
|
|
1
|
A natural axiomatization of Church’s thesis
– Nachum Dershowitz, Yuri Gurevich
- 2007
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
|
Kurt Gödel, `Über formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme I' (1931)
– Richard Zach
|
|
1
|
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
– Robert I. Soare
- 2009
|
|
|
Undecidability in quantum mechanics
– Luigi Foschini
- 1998
|
|
|
UNDECIDABLE PROBLEMS: A SAMPLER
– Bjorn Poonen
|
|
3
|
Computability and Incomputability
– Robert I. Soare
|
|
4
|
How much can analog and hybrid systems be proved (super-)Turing
– Olivier Bournez
- 2006
|
|
|
Church’s Thesis
– Guram Bezhanishvili
|
|
1
|
Gödel on computability *
– Wilfried Sieg
|
|
13
|
Computation and Hypercomputation
– Mike Stannett
- 2003
|
|
|
Hilbert and Set Theory
– Burton Dreben , Akihiro Kanamori
- 1997
|
|
2
|
Hilbert’s Program Then and Now
– Richard Zach
- 2005
|
|
16
|
Higher Order Logic
– Daniel Leivant
- 1994
|
|
7
|
Hilbert’s twenty-fourth problem
– Rüdiger Thiele
- 2001
|
|
2
|
Proving First-Order Equality Theorems with Hyper-Linking
– Geoffrey David Alexander
- 1995
|
|
10
|
A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS
– Nachum Dershowitz, Yuri Gurevich
|
|
1
|
A short survey of automated reasoning
– John Harrison
|
