Yablo's Paradox And Arithmetical Incompleteness

Details Yablo's Paradox And Arithmetical Incompleteness Yablo's Paradox And Arithmetical Incompleteness

2011-10-10

arxiv.org/abs/1110.2056v3

Mathematics

Logic

Scientific paper

In this short paper, I present a few theorems on sentences of arithmetic which are related to Yablo's Paradox as G\"odel's first undecidable sentence was related to the Liar paradox. In particular, I consider two different arithemetizations of Yablo's sentences: one resembling G\"odel's arithmetization of the Liar, with the negation outside of the provability predicate, one resembling Jeroslow's undecidable sentence, with negation inside. Both kinds of arithmetized Yablo sentence are undecidable, and connected to the consistency sentence for the ambient formal system in roughly the same manner as G\"odel and Jeroslow's sentences. Finally, I consider a sentence which is related to the Henkin sentence "I am provable" in the same way that first two arithmetizations are related to G\"odel and Jeroslow's sentences. I show that this sentence is provable, using L\"ob's theorem, as in the standard proof of the Henkin sentence.

Affiliated with

Also associated with

No associations

Rating

Yablo's Paradox And Arithmetical Incompleteness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Yablo's Paradox And Arithmetical Incompleteness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Yablo's Paradox And Arithmetical Incompleteness will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-147359