Undecidable Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

ISBN-10: 0486432289

ISBN-13: 9780486432281

Edition: 2004

Authors: Martin Davis

List price: $24.95 Buy it from $13.75
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Gdel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Gdel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. 1965 edition.
Used Starting from $13.75
New Starting from $20.12
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Algebra Online content $4.95 $1.99
Customers also bought

Book details

List price: $24.95
Copyright year: 2004
Publisher: Dover Publications, Incorporated
Publication date: 2/18/2004
Binding: Paperback
Pages: 416
Size: 6.00" wide x 9.00" long x 1.00" tall
Weight: 1.144
Language: English

On Formally Undecidable Propositions of the Principia Mathematica and Related Systems. I
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
An Unsolvable Problem of Elementary Number Theory
A Note on the Entscheidungsproblem
On Computable Numbers, with an Application to the Entscheidungsproblem
Systems of Logic Based on Ordinals
An Informal Exposition of Proofs of Godel's Theorem and Church's Theorem
Extensions of Some Theorems of Godel and Church
General Recursive Functions of Natural Numbers
Recursive Predicates and Quantifiers
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 Anticipation
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.