[drdeca]

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.

[wuliwong]

Not sure why I should be "wary." I was asking a question. If one should be wary of asking questions about something how could they ever learn?

[drdeca]

Sorry, yes, good point