Naming and Diagonalization, from Cantor to Gödel to Kleene (2006)


Download Links

by Haim Gaifman
Venue:in Logic Journal of the IGPL, 22 pages, and on Gaifman’s website
Citations:3 - 2 self

Active Bibliography

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
32 Computability and recursion – Robert I. Soare - 1996
5 Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems – Keiichirou Kusakari - 2000
Extensions, Automorphisms, and Definability – Robert I. Soare
3 Computability and Incomputability – Robert I. Soare
4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
Global semantic typing for inductive and coinductive computing – Daniel Leivant
Lambda-Calculus and Functional Programming – Jonathan P. Seldin
5 The history and concept of computability – Robert I. Soare - 1999
4 Alan Turing and the Mathematical Objection – Gualtiero Piccinini - 2003
Arithmetic and the Incompleteness Theorems – Richard W. Kaye - 2000
2 Length Of Polynomial Ascending Chains And Primitive Recursiveness – Guillermo Moreno Socías - 1992
JACQUES HERBRAND: LIFE, LOGIC, AND AUTOMATED DEDUCTION – Claus-peter Wirth, Jörg Siekmann, Christoph Benzmüller, Serge Autexier
1 Kleene’s Amazing Second Recursion Theorem (Extended Abstract) – Yiannis N. Moschovakis
Mathematical Definability – Theodore A. Slaman
1 The Church-Turing Thesis as an Immature Form of the Zuse-Fredkin Thesis (More Arguments in Support of the “Universe as a Cellular Automaton” Idea) – Plamen Petrov
8 Programmability of Chemical Reaction Networks – Matthew Cook, David Soloveichik, Erik Winfree, Jehoshua Bruck
2 A natural axiomatization of Church’s thesis – Nachum Dershowitz, Yuri Gurevich - 2007