Iranian Association of Logic
Owner
Iranian Association of Logic (IAL) is the owner of Logical Letter.
Volume 1, Issue 1 (2026)
3 2026, 1(1): 8-14 |
Back to browse issues page
Request Type: Original Research |
Received: 2026/10/21 | Accepted: 2027/01/2 | Published: 2027/01/2
Received: 2026/10/21 | Accepted: 2027/01/2 | Published: 2027/01/2
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Roshandel Tavana N. Gödel's Incompleteness Theorems: What They Do and Do Not Show. 3 2026; 1 (1) :8-14
URL: http://daneshafarand.org/article-9-87268-en.html
URL: http://daneshafarand.org/article-9-87268-en.html
Amir Kabir University
Abstract: (1 Views)
Aims This article gives a precise but accessible account of Gödel's two incompleteness theorems and separates what they establish from the many claims that are made in their name.
Approach The theorems are stated carefully for effectively axiomatized theories of arithmetic. The main steps of the proof (arithmetization, representability and the diagonal lemma) are explained informally, and the later strengthenings due to Rosser, Hilbert, Bernays and Löb are described.
Main Points The first theorem shows that no consistent, effectively axiomatized theory that contains a modest amount of arithmetic can decide every arithmetical sentence. The second shows that such a theory cannot prove its own consistency. Both results depend essentially on their hypotheses. They do not imply that every formal system is incomplete, that mathematical truth is unknowable, that we cannot be confident of the consistency of arithmetic, or that the human mind cannot be a machine.
Conclusion The incompleteness theorems are precise statements about formal theories. Read correctly, they mark a lasting limit on the axiomatic method and open several of the most fruitful directions in modern logic.
Approach The theorems are stated carefully for effectively axiomatized theories of arithmetic. The main steps of the proof (arithmetization, representability and the diagonal lemma) are explained informally, and the later strengthenings due to Rosser, Hilbert, Bernays and Löb are described.
Main Points The first theorem shows that no consistent, effectively axiomatized theory that contains a modest amount of arithmetic can decide every arithmetical sentence. The second shows that such a theory cannot prove its own consistency. Both results depend essentially on their hypotheses. They do not imply that every formal system is incomplete, that mathematical truth is unknowable, that we cannot be confident of the consistency of arithmetic, or that the human mind cannot be a machine.
Conclusion The incompleteness theorems are precise statements about formal theories. Read correctly, they mark a lasting limit on the axiomatic method and open several of the most fruitful directions in modern logic.
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |