Home > Publisher File - No Category
FREE Shipping on 3 books or more! - for all UK orders - find out more
Availability
In stock, available today
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.
Be the first to Write a Review for this item!
Order 3 or more books to enjoy FREE UK delivery!
£5.00
In Stock items are sent same day (Monday to Friday before 3 pm) or within one working day.
Find out more in our full delivery and returns information
Undecidable Theories£14.49
On Formally Undecidable Propositions of Principia Mathematica and Related System£9.99