Some Infinitary Paradoxes and Undecidable Sentences in Peano Arithmetic
Ka-Yue Cheng
Abstract
Open-access reader
Ka-Yue Cheng
Abstract
Open-access reader
According to Chaitin, Gödel once told him "it doesn't matter which paradox you use [to prove the First Incompleteness Theorem]". In this paper I will present a few infinitary paradoxes and show how to "translate" them to some undecidable sentences in Peano arithmetic, like what Gödel did to the Liar paradox. The results partly verify Gödel's claim.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
According to Chaitin, Gödel once told him "it doesn't matter which paradox you use [to prove the First Incompleteness Theorem]". In this paper I will present a few infinitary paradoxes and show how to "translate" them to some undecidable sentences in Peano arithmetic, like what Gödel did to the Liar paradox. The results partly verify Gödel's claim.
Key concepts: Undecidable problem, Peano axioms, Gödel's incompleteness theorems, Mathematics, Arithmetic, Second-order arithmetic, Discrete mathematics, Decidability