The impact of Gödel's incompleteness theorems on mathematics (Q2856483)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The impact of Gödel's incompleteness theorems on mathematics |
scientific article; zbMATH DE number 6220596
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The impact of Gödel's incompleteness theorems on mathematics |
scientific article; zbMATH DE number 6220596 |
Statements
29 October 2013
0 references
Gödel's incompleteness theorems
0 references
philosophy of mathematics
0 references
logical number theory
0 references
arithmetic
0 references
The impact of Gödel's incompleteness theorems on mathematics (English)
0 references
This 25-pages book chapter discusses the mathematical effects of Gödel's incompleteness theorems. Not less than 10 pages of it constitute the Appendix: Modularity, Fermat's Last Theorem, and PA (Peano's arithmetic). The rest (main body) consists of 10 sections: 1. Gödel's contemporaries in logic, 2. The mathematical evolution of the ideas, 3. How the number theorists react to the Gödel phenomenon, 4. Group theory, 5. Geometry and dynamical systems, 6. Set theory, 7. Logical form, 8. Ramsey independence, 9. Topological moderee, and finally 10. Conclusion. So, this chapter is historical, philosophical and mathematical in nature, discussing wide areas where Gödel's incompleteness phenomenon may show up. We read in the Conclusion that:NEWLINENEWLINE``As far as incompleteness is concerned, its remote presence has little effect on current mathematics. Some of the techniques that originated in Gödel's early work (and in the work of his contemporaries) remain central in logic and occasionally in work connecting logic and the rest of mathematics. The long-known connections between Diophantine equations, or combinatorics, and consistency statements in set theory seem to have little to do with major structural issues in arithmetic. That PA is entirely natural in the context of finite combinatorics can hardly be denied, but no one has succeeded in crossing the gap between finite combinatorics and arithmetic (especially arithmetic geometry). As far as the geometry of sufficiently general Riemannian manifolds is concerned, techniques descended from Gödel have proved illuminating (Soare, 2004), without the results being sold as `natural independence'.''NEWLINENEWLINEFor the entire collection see [Zbl 1253.00009].
0 references