arXiv Analytics

Sign in

arXiv:1604.03452 [math.LO]AbstractReferencesReviewsResources

Some Infinitary Paradoxes and Undecidable Sentences in Peano Arithmetic

Ka-Yue Cheng

Published 2016-04-12Version 1

According to Chaitin, G\"odel 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\"odel did to the Liar paradox. The results partly verify G\"odel's claim.

Comments: 10 pages
Categories: math.LO
Subjects: 03F40
Related articles: Most relevant | Search more
arXiv:2111.14413 [math.LO] (Published 2021-11-29, updated 2022-01-25)
Friedman-reflexivity: interpreters as consistoids
arXiv:2102.00295 [math.LO] (Published 2021-01-30)
The model theory of residue rings of models of Peano Arithmetic: The prime power case
arXiv:2110.12233 [math.LO] (Published 2021-10-23, updated 2022-10-31)
Finding the limit of incompleteness II

Links

Toolbox