Theftz22
Smash Lord
Quote straight from Limitations of Godel's theorems: "Gödel's theorems only apply to effectively generated (that is, recursively enumerable) theories. If all true statements about natural numbers are taken as axioms for a theory, then this theory is a consistent, complete extension of Peano arithmetic (called true arithmetic) for which none of Gödel's theorems hold, because this theory is not recursively enumerable"
Godel's theorems do not apply to peano arithmetic.
Besides, I fail to see what you're trying to prove with this. I can only point you here
Godel's theorems do not apply to peano arithmetic.
Besides, I fail to see what you're trying to prove with this. I can only point you here