On the arithmetization of the syntax of first-order arithmetic

Stephen Boyce

公開日: 2010/10/6

Abstract

It is generally accepted that a relatively straightforward application of G\"odel's proof establishes conclusively the incompleteness of first-order number theory. This paper shows that, surprisingly, a very brief, purely syntactical addition to the conventional demonstration establishes that the class of theorems of such systems is not well defined.