On the depth of G\"{o}del's incompleteness theorem
Yong Cheng

TL;DR
This paper investigates the philosophical and methodological aspects of G"{o}del's incompleteness theorem, proposing criteria like influence, fruitfulness, and unity to explain its perceived depth in mathematical logic.
Contribution
It introduces a novel philosophical framework with three criteria to analyze the depth of G"{o}del's incompleteness theorem, focusing on its influence, fruitfulness, and unity.
Findings
G"{o}del's theorem is considered deep due to its influence, fruitfulness, and unity.
The proposed criteria offer a new philosophical perspective on mathematical depth.
Explanations support the validity of the criteria in assessing the theorem's depth.
Abstract
In this paper, we use G\"{o}del's incompleteness theorem as a case study for investigating mathematical depth. We take for granted the widespread judgment by mathematical logicians that G\"{o}del's incompleteness theorem is deep, and focus on the philosophical question of what its depth consists in. We focus on the methodological study of the depth of G\"{o}del's incompleteness theorem, and propose three criteria to account for its depth: influence, fruitfulness, and unity. Finally, we give some explanations for our account of the depth of G\"{o}del's incompleteness theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Philosophy and Theoretical Science · Advanced Topology and Set Theory
