2000 character limit reached
On Arithmetical Truth of the Self-Referential Sentences
Published 14 Jul 2016 in math.LO | (1607.04055v3)
Abstract: We take an argument of G\"odel's from his ground-breaking 1931 paper, generalize it, and examine its validity. The argument in question is this: the sentence $G$ says about itself that it is not provable, and $G$ is indeed not provable; therefore, $G$ is true.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.