3 ms·
Presburger arithmetic is a decidable theory. "This means it is possible to algorithmically determine, for any sentence in the language of Presburger arithmetic,
by drdeca 7y ago
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 7y agoNot 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 7y agoSorry, yes, good point
- beastoven 7y agoGood point because of all those unified field theories that use Presburger arithmetic. :clown:
- drdeca 7y agoI 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.