English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this short paper, I present a few theorems on sentences of arithmeticwhich are related to Yablo's Paradox as G\"odel's first undecidable sentencewas related to the Liar paradox. In particular, I consider two differentarithemetizations of Yablo's sentences: one resembling G\"odel'sarithmetization of the Liar, with the negation outside of the provabilitypredicate, one resembling Jeroslow's undecidable sentence, with negationinside. Both kinds of arithmetized Yablo sentence are undecidable, andconnected to the consistency sentence for the ambient formal system in roughlythe same manner as G\"odel and Jeroslow's sentences.  Finally, I consider a sentence which is related to the Henkin sentence "I amprovable" in the same way that first two arithmetizations are related toG\"odel and Jeroslow's sentences. I show that this sentence is provable, usingL\"ob's theorem, as in the standard proof of the Henkin sentence.

Yablo's Paradox And Arithmetical Incompleteness