Inexhaustibility: A Non-Exhaustive Treatment: Lecture Notes in Logic 16
Autor Torkel Franzénen Limba Engleză Hardback – 2 sep 2004
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 310.53 lei 6-8 săpt. | |
CRC Press – 2 sep 2004 | 310.53 lei 6-8 săpt. | |
Hardback (1) | 553.41 lei 6-8 săpt. | |
CRC Press – 2 sep 2004 | 553.41 lei 6-8 săpt. |
Preț: 553.41 lei
Preț vechi: 741.44 lei
-25% Nou
Puncte Express: 830
Preț estimativ în valută:
105.95€ • 110.12$ • 87.84£
105.95€ • 110.12$ • 87.84£
Carte tipărită la comandă
Livrare economică 07-21 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781568811741
ISBN-10: 1568811748
Pagini: 268
Dimensiuni: 156 x 234 mm
Greutate: 0.5 kg
Ediția:1
Editura: CRC Press
Colecția A K Peters/CRC Press
ISBN-10: 1568811748
Pagini: 268
Dimensiuni: 156 x 234 mm
Greutate: 0.5 kg
Ediția:1
Editura: CRC Press
Colecția A K Peters/CRC Press
Recenzii
"In this book the author discusses Gödel's famous incompleteness theorems. Special emphasis is put on the consequences of the inexhaustibility of our mathematical knowledge in any one formal axiomatic theory ... The book can be considered as a more technical companion to the author's more philosophical book [Gödel's Theorem, A K Peters, Wellesley, MA, 2005]." -Mathematiacl Reviews, November 2007
Notă biografică
Torkel Franzén Department of Computer Science and Electrical Engineering Lule, University of Technology
Cuprins
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
Descriere
Gödel's Incompleteness Theorems are among the most significant results in the foundation of mathematics