Set Theory and Logic

   

Why is the Gödel Self-Referential Equation Unsolvable?

Authors: Jincheng Zhang

There exists a Gödel number for each formula of the system N of natural numbers. The Gödel undecidable proposition, which is also a formula of the system N, also exists a Gödel number p; at the same time, the Gödel undecidable proposition is a self-referential proposition u([p]) substituted into its own Gödel number, and the self-referential proposition u([p]) Gödel number is also p, i.e., there is, u([p])=p. It can be This equation has no solution.The traditional view is that the Gödel undecidable proposition u([p]) is a closed formula and is a natural number proposition; we here transform the Gödel self-referential proposition into a self-referential equation and find that this equation has no solution and the Gödel undecidable proposition u([p]) is not a natural number proposition. u([p]) is an unclosed term (out-of-domain term) that evolves on the set of natural numbers and u([p]) is not a closed formula.

Comments: 13 Pages.

Download: PDF

Submission history

[v1] 2023-02-20 01:36:24

Unique-IP document downloads: 201 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus