Earlier quoted context omitted.
Presburger arithmetic is a decidable theory. "This means it is possible to algorithmically determine, for any sentence in the language of Presburger arithmetic, whether that sentence is provable from the axioms of Presburger arithmetic." If you don't understand what the incompleteness theorems say, be wary of citing them.
Good point because of all those unified field theories that use Presburger arithmetic. :clown:
I wasn’t suggesting that they would. I was warning against over-application/interpretation by giving an example of something one might not expect if one interprets the theorems too broadly.