Research work · 2001

On the Goedel's formula

Jailton C. Ferreira

arXiv (Cornell University)

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.

Download PDF

DOI: 10.48550/arxiv.math/0104025