Switch to: Citations

Add references

You must login to add references.
  1. The Mathematical Work of S. C. Kleene.J. R. Shoenfield & S. C. Kleene - 1995 - Bulletin of Symbolic Logic 1 (1):8-43.
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Church's Thesis Without Tears.Fred Richman - 1983 - Journal of Symbolic Logic 48 (3):797-803.
    The modern theory of computability is based on the works of Church, Markov and Turing who, starting from quite different models of computation, arrived at the same class of computable functions. The purpose of this paper is the show how the main results of the Church-Markov-Turing theory of computable functions may quickly be derived and understood without recourse to the largely irrelevant theories of recursive functions, Markov algorithms, or Turing machines. We do this by ignoring the problem of what constitutes (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Ingenio e Industria. Guía de referencia sobre la Tesis de Turing-Church.Enrique Alonso - 1999 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 14 (2):249-273.
    La Teoría de la Computación es un campo especialmente rico para la indagación filosófica. EI debate sobre el mecanicismo y la discusión en torno a los fundamentos de la matemática son tópicos que estan directamente asociados a la Teoria de la Computación desde su misma creación como disciplina independiente. La Tesis de Turing-Church constituye uno de los resultados mas característicos en este campo estando, además, lleno de consecuencias filosóficas. En este ensayo se ofrece una guía de referencia útil a aquellos (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  • Step by Recursive Step: Church's Analysis of Effective Calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.
    Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  • On Notation for Ordinal Numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.
  • Alonzo Church:His Life, His Work and Some of His Miracles.Maía Manzano - 1997 - History and Philosophy of Logic 18 (4):211-232.
    This paper is dedicated to Alonzo Church, who died in August 1995 after a long life devoted to logic. To Church we owe lambda calculus, the thesis bearing his name and the solution to the Entscheidungsproblem.His well-known book Introduction to Mathematical LogicI, defined the subject matter of mathematical logic, the approach to be taken and the basic topics addressed. Church was the creator of the Journal of Symbolic Logicthe best-known journal of the area, which he edited for several decades This (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Direct download  
     
    Export citation  
     
    Bookmark   516 citations  
  • Alonzo Church.[author unknown] - 1997 - Bulletin of Symbolic Logic 3 (2):153-153.
     
    Export citation  
     
    Bookmark   16 citations  
  • Recursive Predicates and Quantifiers.S. C. Kleene - 1943 - Journal of Symbolic Logic 8 (1):32-34.
  • General Recursive Functions of Natural Numbers.S. C. Kleene - 1937 - Journal of Symbolic Logic 2 (1):38-38.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  • The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions.Martin Davis (ed.) - 1965 - Dover Publication.
    "A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by (...)
    Direct download  
     
    Export citation  
     
    Bookmark   72 citations  
  • Origins of Recursive Function Theory.Stephen C. Kleene & Martin Davis - 1990 - Journal of Symbolic Logic 55 (1):348-350.
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  • An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
    Direct download  
     
    Export citation  
     
    Bookmark   110 citations  
  • Reflections on Church's Thesis.Stephen C. Kleene - 1987 - Notre Dame Journal of Formal Logic 28 (4):490-498.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations