• An Introduction to Godel's Theorems See large image

    An Introduction to Godel's Theorems (Cambridge Introductions to Philosophy) (Paperback) By (author) Peter Smith

    $30.76 - Save $1.52 (4%) - RRP $32.28 Free delivery worldwide Available
    Dispatched in 2 business days
    When will my order arrive?
    Add to basket | Add to wishlist |

    DescriptionIn 1931, the young Kurt Godel published his First Incompleteness Theorem, which tells us that, for any sufficiently rich theory of arithmetic, there are some arithmetical truths the theory cannot prove. This remarkable result is among the most intriguing (and most misunderstood) in logic. Godel also outlined an equally significant Second Incompleteness Theorem. How are these Theorems established, and why do they matter? Peter Smith answers these questions by presenting an unusual variety of proofs for the First Theorem, showing how to prove the Second Theorem, and exploring a family of related results (including some not easily available elsewhere). The formal explanations are interwoven with discussions of the wider significance of the two Theorems. This book - extensively rewritten for its second edition - will be accessible to philosophy students with a limited formal background. It is equally suitable for mathematics students taking a first course in mathematical logic.

Other books

Other people who viewed this bought | Other books in this category
Showing items 1 to 10 of 10


Reviews | Bibliographic data
  • Full bibliographic data for An Introduction to Godel's Theorems

    An Introduction to Godel's Theorems
    Authors and contributors
    By (author) Peter Smith
    Physical properties
    Format: Paperback
    Number of pages: 402
    Width: 174 mm
    Height: 244 mm
    Thickness: 20 mm
    Weight: 800 g
    ISBN 13: 9781107606753
    ISBN 10: 1107606756

    BIC E4L: PHI
    Nielsen BookScan Product Class 3: S2.1
    B&T Book Type: NF
    B&T Modifier: Region of Publication: 03
    BIC subject category V2: HPL, PBCD
    B&T General Subject: 710
    B&T Modifier: Academic Level: 02
    LC classification: QA
    Ingram Subject Code: MA
    Libri: I-MA
    B&T Modifier: Text Format: 06
    DC22: 511.3
    LC subject heading:
    Abridged Dewey: 511
    Warengruppen-Systematik des deutschen Buchhandels: 16240
    B&T Merchandise Category: UP
    BIC subject category V2: PBB
    BISAC V2.8: MAT015000, MAT018000
    DC23: 511.3
    LC subject heading:
    Ingram Theme: ASPT/PHILAS
    Thema V1.0: PBB, QDTL, PBCD
    2, Revised
    Edition statement
    2nd Revised edition
    Imprint name
    Publication date
    31 May 2013
    Publication City/Country
    Author Information
    Peter Smith was formerly Senior Lecturer in Philosophy at the University of Cambridge. His books include Explaining Chaos (1998) and An Introduction to Formal Logic (2003) and he is also a former editor of the journal Analysis.
    Table of contents
    Preface; 1. What Godel's theorems say; 2. Functions and enumerations; 3. Effective computability; 4. Effectively axiomatized theories; 5. Capturing numerical properties; 6. The truths of arithmetic; 7. Sufficiently strong arithmetics; 8. Interlude: taking stock; 9. Induction; 10. Two formalized arithmetics; 11. What Q can prove; 12. I o, an arithmetic with induction; 13. First-order Peano arithmetic; 14. Primitive recursive functions; 15. LA can express every p.r. function; 16. Capturing functions; 17. Q is p.r. adequate; 18. Interlude: a very little about Principia; 19. The arithmetization of syntax; 20. Arithmetization in more detail; 21. PA is incomplete; 22. Godel's First Theorem; 23. Interlude: about the First Theorem; 24. The Diagonalization Lemma; 25. Rosser's proof; 26. Broadening the scope; 27. Tarski's Theorem; 28. Speed-up; 29. Second-order arithmetics; 30. Interlude: incompleteness and Isaacson's thesis; 31. Godel's Second Theorem for PA; 32. On the 'unprovability of consistency'; 33. Generalizing the Second Theorem; 34. Lob's Theorem and other matters; 35. Deriving the derivability conditions; 36. 'The best and most general version'; 37. Interlude: the Second Theorem, Hilbert, minds and machines; 38. mu-Recursive functions; 39. Q is recursively adequate; 40. Undecidability and incompleteness; 41. Turing machines; 42. Turing machines and recursiveness; 43. Halting and incompleteness; 44. The Church-Turing thesis; 45. Proving the thesis?; 46. Looking back.