Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2001
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/math/0104025 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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.