Search History

Holdings Information

    • Title:The undecidable : basic papers on undecidable propositions, unsolvable problems and computable functions / edited by Martin Davis, Professor Emeritus, Courant Institute of Mathematical Sciences, New York University.
    • ISBN:0486432289
      9780486432281
    • Edition:Dover edition.
    • Publication:Mineola, New York : Dover Publications, Inc., 2004.
    • Copyright notice date: ©1993
    • Physical Description:413 pages ; 24 cm
    • Yale Holdings

       
    • Local Notes:BEIN Zab L489 Zz2004T: Paperbound. From the David Leavitt Papers.
    • Notes:Originally published: Hewlett, New York : Raven Press Books, Ltd., 1965.
    • Summary:An anthology of fundamental papers on undecidability and unsolvability, this classic reference opens with Gödel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Goèdel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. --from publisher description.
    • Format:Book
    • BibliographyIncludes bibliographical references and index.
    • Contents:On formally undecidable propositions of the Principia Mathematica and related systems ; On undecidable propositions of formal mathematical systems ; On intuitionistic arithmetic and number theory ; On the length of proofs ; Remarks before the Princeton Bicentennial Conference on Problems in Mathematics / Kurt Gödel -- An unsolvable problem of elementary number theory ; A note on the entscheidungsproblem / Alonzo Church -- On computable numbers, with an application to the entscheidungsproblem ; Systems of logic based on ordinals / Alan M. Turing -- An informal exposition of proofs of Gödel's theorem and Church's theorem ; Extensions of some theorems of Gödel and Church / J.B. Rosser -- General recursive functions of natural number ; Recursive predicates and quantifiers / Stephen C. Kleene -- Finite combinatory processes: formulation I ; Recursive unsolvability of a problem of Thue ; Recursively enumerable sets of positive integers and their decision problems ; Absolutely unsolvable problems and relatively undecidable propositions: account of an application / Emil Post.
    • Subjects:Gödel's theorem.
      Unsolvability (Mathematical logic)
      Recursive functions.
      Turing machines.
      Computable functions.
      Computable functions.
      Gödel's theorem.
      Recursive functions.
      Turing machines.
      Unsolvability (Mathematical logic)
    • Subjects (Local Yale):Leavitt, David, 1961---Ownership.
    • Also listed under:Davis, Martin, 1928-2023, editor.