A Context for Paris-Harrington Combinatorial Principle
Joel Torres Del valle
TL;DR
This paper reviews the history of incompleteness in mathematics and studies the Paris-Harrington combinatorial principle, focusing on its formalization within arithmetic language.
Contribution
It provides a historical context and formal analysis of the Paris-Harrington principle within arithmetic, highlighting its significance in incompleteness results.
Findings
Paris-Harrington principle can be formalized in arithmetic
The principle relates to incompleteness in mathematical systems
Historical review of incompleteness in 20th-century mathematics
Abstract
A historical review of the problem of incompleteness in Mathematics since the 20th century is made. The Combinatorial Principle of Paris-Harrington is studied and the way in which it can be codified in the language of Arithmetic.
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 · Advanced Algebra and Logic · Logic, Reasoning, and Knowledge