On Arithmetical Truth of the Self-Referential Sentences
classification
🧮 math.LO
keywords
argumentprovablearithmeticalexaminegeneralizeground-breakingindeeditself
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.