On the Goedel's formula
Abstract
The proof of Goedel's first incompleteness theorem includes the construction of an arithmetic formula G that represents the metamathematical statement: the formula G is not provable. This article examines the formula G (of Goedel). We demonstrated that there is no Goedel's number for the formula G if number of provable well formed formulae with one free variable is finite. If there is a non-finite number of provable propositions in the theory, then Goedel's formula also does not possess the Goedel's number.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.