- #71
Adam Mclean
- 23
- 0
Apparently in his book 'A decision method for elementary
algebra and geometry', 1948, Tarski showed that the first-order
theory of the real numbers under addition and multiplication is decidable.
This seems at first glimpse in contradiction to Godel's
Incompleteness Theorem, but of course, as we have
analysed in this thread, there is a considerable difference
formally between the Natural numbers and the Reals.
Note this result of Tarski is within a first-order logic
and does not require us to step into a sccond order logic.
I don't have access at the moment to this work of Tarski.
Can anyone confirm this reference is correct?
Adam McLean
algebra and geometry', 1948, Tarski showed that the first-order
theory of the real numbers under addition and multiplication is decidable.
This seems at first glimpse in contradiction to Godel's
Incompleteness Theorem, but of course, as we have
analysed in this thread, there is a considerable difference
formally between the Natural numbers and the Reals.
Note this result of Tarski is within a first-order logic
and does not require us to step into a sccond order logic.
I don't have access at the moment to this work of Tarski.
Can anyone confirm this reference is correct?
Adam McLean