There May Be Many Arithmetical Gödel Sentences

We argue that, under the usual assumptions for sufficiently strong arithmetical theories that are subject to Gödel's First Incompleteness Theorem, one cannot, without impropriety, talk about the Gödel sentence of the theory. The reason is that, without violating the requirements of Gödel's theorem, there could be a true sentence and a false one each of which is provably equivalent to its own unprovability in the theory if the theory is unsound.