
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
In many incompleteness proofs there is a claim that, given a Gödel numbering function that encodes sequences of symbols of a given formal system, there is a formula of that formal system that corresponds to that Gödel numbering function such that the formula itself can refer unambiguously to formulas of that formal system. This paper proves that this cannot be the case.
Be the first to like this
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment