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

Front Cover
Courier Corporation, Jan 1, 2004 - Mathematics - 413 pages
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.

What people are saying - Write a review

We haven't found any reviews in the usual places.


On Formally Undecidable Propositions of
On Undecidable Propositions of Formal
On Intuitionistic Arithmetic and Number Theory
On the Length of Proofs
An Unsolvable Problem of Elementary Number Theory
A Note on the Entscheidungsproblem
Systems of Logic Based on Ordinals
Extensions of Some Theorems of Gödel and Church
General Recursive Functions of Natural Numbers
Recursive Predicates and Quantifiers
Finite Combinatory Processes Formulation I
Recursively Enumerable Sets of Positive Integers
Absolutely Unsolvable Problems and Relatively
Index 434

Other editions - View all

Common terms and phrases

About the author (2004)

Martin Davis: Computer Science Pioneer
Dover's publishing relationship with Martin Davis, now retired from NYU and living in Berkeley, goes back to 1985 when we reprinted his classic 1958 book Computability and Unsolvability, widely regarded as a classic of theoretical computer science. A graduate of New York's City College, Davis received his PhD from Princeton in the late 1940s and became one of the first computer programmers in the early 1950s, working on the ORDVAC computer at The University of Illinois. He later settled at NYU where he helped found the Computer Science Department.

Not many books from the infancy of computer science are still alive after several decades, but Computability and Unsolvability is the exception. And The Undecidable is an anthology of fundamental papers on undecidability and unsolvability by major figures in the field including Godel, Church, Turing, Kleene, and Post.

Critical Acclaim for Computability and Unsolvability:
"This book gives an expository account of the theory of recursive functions and some of its applications to logic and mathematics. It is well written and can be recommended to anyone interested in this field. No specific knowledge of other parts of mathematics is presupposed. Though there are no exercises, the book is suitable for use as a textbook." — J. C. E. Dekker, Bulletin of the American Mathematical Society, 1959

Critical Acclaim for The Undecidable:
"A valuable collection both for original source material as well as historical formulations of current problems." — The Review of Metaphysics

"Much more than a mere collection of papers . . . a valuable addition to the literature." — Mathematics of Computation

Bibliographic information