Torkel Franzén

Inexhaustibility

A Non-Exhaustive Treatment: Lecture Notes in Logic 16

• Broschiertes Buch

Produktbeschreibung

This text is concerned with the concept that our mathematical knowledge is inexhaustible. Basic material in predicate logic, set theory and recursion theory is presented, leading to a proof of incompleteness theorems.

---

Gödel's Incompleteness Theorems are among the most significant results in the foundation of mathematics

Produktdetails

• Verlag: A K Peters/CRC Press
• Seitenzahl: 268
• Erscheinungstermin: 2. September 2004
• Englisch
• Abmessung: 229mm x 152mm x 15mm
• Gewicht: 393g
• ISBN-13: 9781568811758
• ISBN-10: 1568811756
• Artikelnr.: 32905272

Autorenporträt

Torkel Franzén Department of Computer Science and Electrical Engineering Lule, University of Technology

Inhaltsangabe

CHAPTER l. INTRODUCTION . CHAPTER 2. ARITHMETICAL PRELIMINARIES CHAPTER 3.
PRIMES AND PROOFS . CHAPTER 4. THE LANGUAGE OF ARITHMETIC CHAPTER 5. THE
LANGUAGE OF ANALYSIS CHAPTER 6. ORDINALS AND INDUCTIVE DEFINITIONS. CHAPTER
7. FORMAL LANGUAGES AND THE DEFINITION OF TRUTH CHAPTER 8. LOGICC AND
THEORIES. CHAPTER 9. PEA.NO ARTHMETIC AND COMPUTABILl1Y CHAPTER 9. PEA.NO
ARTHMETIC AND COMPUTABILl1Y CHAPTER 10. ELEMENTARY AND CLASSICAL ANALYSIS
CHAPTER 11. THE RECURSION THEOREM AND ORDINAL NOTATIONS CHAPTER 12. THE
INCOMPLETENESS THEOREMS CHAPTER 13. ITERATED CONSISTENCY CHAPTER 14.
ITERATED REFLECTION CHAPTER 15. ITERATED ITERATION AND INEXHAUSTIBILITY