{"product_id":"the-undecidable-basic-papers-on-undecidable-propostions-unsolvable-problems-and-computable-functions-dover-books-on-mathematics","title":"The Undecidable: Basic Papers on Undecidable Propostions, Unsolvable Problems and Computable Functions (Dover Books on Mathematics)","description":"\u003ch3\u003e\u003cstrong\u003eBook Details\u003c\/strong\u003e\u003c\/h3\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003eAuthor\u003c\/strong\u003e: Martin Davis\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003eBrand\u003c\/strong\u003e: Dover\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003eEdition\u003c\/strong\u003e: Illustrated\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003eBinding\u003c\/strong\u003e: Paperback\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003eFormat\u003c\/strong\u003e: Illustrated\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003eNumber of Pages\u003c\/strong\u003e: 416\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003eRelease Date\u003c\/strong\u003e: 18-02-2004\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003eLanguages\u003c\/strong\u003e: English\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003eISBN\u003c\/strong\u003e: 9780486432281\u003c\/p\u003e\n\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003chr\u003e\n\u003ch3\u003e\u003cstrong\u003eAbout the Book\u003c\/strong\u003e\u003c\/h3\u003e\n\u003cp\u003eThis anthology presents a collection of fundamental papers on undecidability and unsolvability, penned by key figures in the field. It serves not only as an invaluable source of original materials but also as a historical reference that outlines current problems in the domains of logic, mathematics, and philosophy. This classic reference work is ideal for graduate and undergraduate courses in logic, philosophy, and the foundations of mathematics, and also serves as an excellent resource for self-study.\u003c\/p\u003e\n\u003cp\u003eThe volume opens with Kurt Gödel's landmark 1931 paper, which established that systems of logic cannot prove all true assertions of arithmetic. It then includes seminal works by Gödel, Alonzo Church, Alan Turing, and Emil Post, each contributing to the concept of recursive functions and the limitations of computability by finite algorithms. The papers explore unsolvable problems in the theory of abstract computing machines, mathematical logic, and algebra. Additionally, works by Church, Turing, and Post cover the notion of unsolvable problems, while contributions by Kleene and Post introduce the classification theory of unsolvable problems.\u003c\/p\u003e\n\u003cp\u003eThe book also includes corrections, emendations, and added commentaries by Gödel, Church, and Kleene, making it a comprehensive and insightful resource for those interested in the historical and theoretical development of the field.\u003c\/p\u003e","brand":"Dover","offers":[{"title":"Default Title","offer_id":49948822634800,"sku":"Sarat_9780486432281","price":1779.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0690\/9968\/4144\/files\/dover-book-default-title-the-undecidable-basic-papers-on-undecidable-propostions-unsolvable-problems-and-computable-functions-dover-books-on-mathematics-41314879865136.jpg?v=1775949807","url":"https:\/\/www.retailmaharaj.com\/bn\/products\/the-undecidable-basic-papers-on-undecidable-propostions-unsolvable-problems-and-computable-functions-dover-books-on-mathematics","provider":"Retail Maharaj","version":"1.0","type":"link"}