The Undecidable, Basic Papers On Undecidable Propositions, Unsolvable Problems And Computable Functions (Including) Five Papers From Godel, Including Godel's "On Undecidable Propositions Of Formal Mathematical Systems" Etc., With New Supplementary Material From Godel, And Turing's "On Computable Numbers." And "Systems Of Logic Based On Ordinals", Also New Supplementary Material From Kleene For His Two Papers

Martin Davis (Editor); Kurt Godel, Alonzo Church, Alan M. Turing, J. B. Rosser, Stephen C. Kleene, Emil Post; Signed Bookplate Of Hal Berghel

ISBN 10: 0911216014 / ISBN 13: 9780911216011

Published by Raven Press, Hewlett Ny, 1965

440 Pp. Blue Cloth, Gilt. Book Is 2.9 Cm Thick (An Otherwise Identical Issue In Blue Cloth Is 3.2 Cm Thick, But With A Different Typesetting Of Title Page And Completely Different Copyright Page , And In A Priced And Different Dust Jacket). Slight Usage; Book Fine, Dj Also Fine. The Book Is An Anthology Of 17 Papers, Most Previously Published, But Including Previously Unpublished Lectures By Godel And An Unpublished Account By Post Of His Early Work, And With Supplementary Material Furnished By Godel And Keene. Signed Bookplate And Also The Name Stamp Of Hal Berghel, Professor Of Computer Science At The University Of Nevada, Las Vegas Where He Has Previously Served As Director Of Both The Schools Of Computer Science And Informatics, And As Associate Dean Of The College Of Engineering. He Created And Directed The First Cybersecurity Degree Programs (Bachelors, Masters And Phd) In Nevada In 2005. He Was The Founding Director Of The Identity Theft And Financial Fraud Research And Operations Center And Cybersecurity Research Center. Seller Inventory # 057419

Synopsis:

This anthology of fundamental papers dealing with undecidability and unsolvability begins with del's epoch-making paper of 1931. This paper demonstrated for the first time that systems of logic--no matter how powerful--could never admit proofs of all true assertions of arithmetic. Included in this outstanding volume are the basic papers of del, Church, Turing, and Post in which the class of recursive functions was singled out and seen to be just the class of functions that can be computed by finite algorithms. Also presented is the work of Church, Turing, and Post in which problems from the theory of abstract computing machines, from mathematical logic, and finally from algebra are shown to be unsolvable in the sense that there is no finite algorithm for dealing with them. Finally, the book presents the work of Kleene and of Post initiating the classification theory of unsolvable problems. Already the standard reference work on the subject, The Undecidable is also ideally suited as a text or supplementary text for courses in logic, philosophy, and foundations of mathematics.

Bibliographic Details

Title: The Undecidable, Basic Papers On Undecidable...
Publisher: Raven Press, Hewlett Ny
Publication Date: 1965
Binding: Hardcover
Condition: Fine
Dust Jacket Condition: Fine
Edition: 1st Edition