The Foundational Fragility of Peano Arithmetic
Fuente:
Zenodo
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Recurso digital |
| Pubblicazione: |
Zenodo
2025
|
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866901348442701824 |
|---|---|
| author | SÉRGIO DE ANDRADE, PAULO |
| author_facet | SÉRGIO DE ANDRADE, PAULO |
| contents | Peano Arithmetic (PA) stands as a foundational pillar of modern mathematics, providing a formal axiomatic framework for the natural numbers. Despite its ubiquity and success in capturing a vast portion of number theory, PA possesses an inherent structural fragility. This paper examines the nature of this fragility through the lens of Kurt Gödel's groundbreaking Incompleteness Theorems. We argue that three key results collectively undermine the aspiration of PA as a complete and self-sufficient foundation for arithmetic. First, Gödel's First Incompleteness Theorem demonstrates that PA is necessarily incomplete, meaning there are true statements about the natural numbers that cannot be proven within the system. Second, his Second Incompleteness Theorem reveals that PA cannot prove its own consistency, a limitation that strikes at the heart of mathematical certainty. Finally, the existence of non-standard models of arithmetic, which satisfy all the axioms of PA but are not isomorphic to the standard natural numbers, shows that the first-order axioms fail to uniquely characterize their intended structure. By analyzing these interconnected limitations, this paper contends that the "fragility" of Peano Arithmetic is not a defect but a fundamental characteristic of any formal system of sufficient complexity, reshaping our understanding of proof, truth, and the limits of mathematical formalism. |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_17689924 |
| institution | Zenodo |
| language | |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | The Foundational Fragility of Peano Arithmetic SÉRGIO DE ANDRADE, PAULO Peano Arithmetic (PA) stands as a foundational pillar of modern mathematics, providing a formal axiomatic framework for the natural numbers. Despite its ubiquity and success in capturing a vast portion of number theory, PA possesses an inherent structural fragility. This paper examines the nature of this fragility through the lens of Kurt Gödel's groundbreaking Incompleteness Theorems. We argue that three key results collectively undermine the aspiration of PA as a complete and self-sufficient foundation for arithmetic. First, Gödel's First Incompleteness Theorem demonstrates that PA is necessarily incomplete, meaning there are true statements about the natural numbers that cannot be proven within the system. Second, his Second Incompleteness Theorem reveals that PA cannot prove its own consistency, a limitation that strikes at the heart of mathematical certainty. Finally, the existence of non-standard models of arithmetic, which satisfy all the axioms of PA but are not isomorphic to the standard natural numbers, shows that the first-order axioms fail to uniquely characterize their intended structure. By analyzing these interconnected limitations, this paper contends that the "fragility" of Peano Arithmetic is not a defect but a fundamental characteristic of any formal system of sufficient complexity, reshaping our understanding of proof, truth, and the limits of mathematical formalism. |
| title | The Foundational Fragility of Peano Arithmetic |
| url | https://doi.org/10.5281/zenodo.17689924 |