Prolog detects pathological self reference in the Gödel sentence

Download Edit this record How to cite View on PhilPapers
This sentence G ↔ ¬(F ⊢ G) and its negation G ↔ ~(F ⊢ ¬G) are shown to meet the conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)). They meet conventional definition of incompleteness because neither the sentence nor its negation is provable in F (or any other formal system). --
No keywords specified (fix it)
PhilPapers/Archive ID
Upload history
First archival date: 2021-04-10
Latest version: 6 (2021-04-15)
View other versions
Added to PP index

Total views
33 ( #59,171 of 2,448,601 )

Recent downloads (6 months)
15 ( #38,220 of 2,448,601 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.