or
Sign in to turn on 1-Click ordering
Sell Us Your Item
For a $1.65 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.
Sorry, this item is not available in
Image not available for
Color:
Image not available

To view this video download Flash Player

 

The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions (Dover Books on Mathematics) [Paperback]

Martin Davis
3.0 out of 5 stars  See all reviews (2 customer reviews)

List Price: $24.95
Price: $16.50 & FREE Shipping on orders over $25. Details
You Save: $8.45 (34%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 3 left in stock (more on the way).
Ships from and sold by Amazon.com. Gift-wrap available.
Want it tomorrow, June 20? Choose One-Day Shipping at checkout. Details
Free Two-Day Shipping for College Students with Amazon Student

Amazon.com Textbooks Store
Shop the Amazon.com Textbooks Store and save up to 70% on textbook rentals, 90% on used textbooks and 60% on eTextbooks.

Book Description

February 18, 2004 0486432289 978-0486432281 Dover Ed
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 Gödel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. 1965 edition.

Frequently Bought Together

The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions (Dover Books on Mathematics) + Computability and Unsolvability + Set Theory and the Continuum Hypothesis (Dover Books on Mathematics)
Price for all three: $36.86

Buy the selected items together


Product Details

  • Paperback: 416 pages
  • Publisher: Dover Publications; Dover Ed edition (February 18, 2004)
  • Language: English
  • ISBN-10: 0486432289
  • ISBN-13: 978-0486432281
  • Product Dimensions: 6.5 x 0.9 x 9.2 inches
  • Shipping Weight: 1.2 pounds (View shipping rates and policies)
  • Average Customer Review: 3.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #848,309 in Books (See Top 100 in Books)

Customer Reviews

3.0 out of 5 stars
(2)
3.0 out of 5 stars
Share your thoughts with other customers
Most Helpful Customer Reviews
43 of 43 people found the following review helpful
5.0 out of 5 stars Very useful reference May 7, 2004
Amazon Verified Purchase
This is a great collection of seminal papers by Goedel, Church, Turing, Rosser, Kleene, and Post on the topic of undecidability. It is an extremely handy reference.

Just to note: this is certainly not a tutorial or guide to this topic for the beginner. Davis provides some prefatory comments, but these are concise and mostly set the context for the papers, rather than explaining the content of the papers. This book is more for someone interested in going back to first sources.

Comment | 
Was this review helpful to you?
0 of 2 people found the following review helpful
Amazon Verified Purchase
I have to be explicit about what it is that I am reviewing. I could be reviewing many things: the mathematical content of the authors whose work is contained herein, the notation that the authors used during the time period of 1930-1941 in which they authored their papers, the editorial work that Martin Davis did on behalf of this volume in 1965, or the work that Dover did in reprinting it in 2004. Categorically, I am speaking about the last of these considerations.

The notation in this book is from an antiquated time, and is unlikely to be familiar to modern students of mathematics. Beyond that, in a treatise on logic, the lack of distinction between metamathematical and object-logic notation would be considered unacceptable in modern times. Yet in these papers, the same set of alien symbols is recycled throughout multiple contexts, which makes it very difficult to keep them straight. For example, a large tilde is used to denote both object-logic unary negation, and the metamathematical binary biconditional. The baseline dot is used to denote both metamathematical conjunction and arithmetic multiplication, which is extremely confusing in the context of a metamathematical proof of the arithmetization of syntax isomorphism between the object logic and the natural numbers. I tried to keep all of this straight by writing it down in my notes, but quickly became frustrated, and ended up searching the Internet for a version of the paper in modern notation. I found one, and I was able to digest the entire modernized paper much more quickly than my muddied forays into the beginnings of the version presented in this book. I could make similar comments about the other parts of the book which I attempted to digest.
... Read more ›
Comment | 
Was this review helpful to you?
Search Customer Reviews
Only search this product's reviews


Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Forums

There are no discussions about this product yet.
Be the first to discuss this product with the community.
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Listmania!


So You'd Like to...


Create a guide


Look for Similar Items by Category