Computability : Computable Functions Logic and the Foundations of Math

4.25 (4 ratings by Goodreads)
By (author)  , By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 11 business days
When will my order arrive?


This book should be of interest to intermediate mathematics undergraduates; postgraduates in theoretical computer science/philosophy of mathematics.
show more

Product details

  • Hardback | 320 pages
  • 187.5 x 246.4 x 19.1mm | 730.3g
  • Taylor & Francis Inc
  • CRC Press Inc
  • Bosa Roca, United States
  • English
  • New.
  • 0534103561
  • 9780534103569

Table of contents

Philosophy and mathematics. Some paradoxes. Whole numbers. Functions. An introduction to the nature of a proof. Infinite collections? Hilbert: on the infinite. Computability. Turing machines. The most amazing fact and Church's thesis. Primitive recursive functions. The Grzegorczyk hierarchy. Multiple recursion and recursion on order types. The least search operator. Partial recursion functions. Numbering the partial recursive functions. Listability. Turing machine computable = partial recursive. Logic and arithmetic, part 1: propositional logic. Logic and arithmetic, part 2: a review. Logic and arithmetic, part 3: first-order arithmetic. Functions representable in formal arithmetic. The undecidability of arithmetic. The unprovability of consistency. Church's thesis. Constructivist view of mathematics. Bibliography. Index of notation. Index.
show more

Rating details

4 ratings
4.25 out of 5 stars
5 25% (1)
4 75% (3)
3 0% (0)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X