An introduction to Gödel's Theorems
著者
書誌事項
An introduction to Gödel's Theorems
（Cambridge introductions to philosophy）
Cambridge University Press, 2007
- : hbk
- : pbk
大学図書館所蔵 件 / 全16件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 346-355) and index
内容説明・目次
内容説明
In 1931, the young Kurt Goedel 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. Goedel 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 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.
目次
- Preface
- 1. What Goedel's Theorems say
- 2. Decidability and enumerability
- 3. Axiomatized formal theories
- 4. Capturing numerical properties
- 5. The truths of arithmetic
- 6. Sufficiently strong arithmetics
- 7. Interlude: taking stock
- 8. Two formalized arithmetics
- 9. What Q can prove
- 10. First-order Peano Arithmetic
- 11. Primitive recursive functions
- 12. Capturing funtions
- 13. Q is p.r. adequate
- 14. Interlude: a very little about Principia
- 15. The arithmetization of syntax
- 16. PA is incomplete
- 17. Goedel's First Theorem
- 18. Interlude: about the First Theorem
- 19. Strengthening the First Theorem
- 20. The Diagonalization Lemma
- 21. Using the Diagonalization Lemma
- 22. Second-order arithmetics
- 23. Interlude: incompleteness and Isaacson's conjecture
- 24. Goedel's Second Theorem for PA
- 25. The derivability conditions
- 26. Deriving the derivability conditions
- 27. Reflections
- 28. Interlude: about the Second Theorem
- 29. Recursive functions
- 30. Undecidability and incompleteness
- 31. Turing machines
- 32. Turing machines and recursiveness
- 33. Halting problems
- 34. The Church-Turing Thesis
- 35. Proving the Thesis?
- 36. Looking back.
「Nielsen BookData」 より