# Decidability of the Multiplicative and Order Theory of Numbers

The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order and addition are decidable and infinitely axiomatizable. For the language of order and multiplication, it is known that the theories of ℕ and ℤ are not decidable (and so not axiomatizable by any computably enumerable set of sentences). By Tarski's theorem, the multiplicative ordered structure of ℝ is decidable also. In this thesis we prove this result directly by quantifier elimination and present an explicit infinite axiomatization. The structure of ℚ in the language of order and multiplication seems to be missing in the literature. We show the decidability of its theory by the technique of quantifier elimination and after presenting an infinite axiomatization for this structure, we prove that it is not finitely axiomatizable.

READ FULL TEXT
Comments

There are no comments yet.