On decidability and axiomatizability of some ordered structures

From MaRDI portal
Publication:2318170



Abstract: The ordered structures of natural, integer, rational and real numbers are studied here. It is known that 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 mathbbN and mathbbZ are not decidable (and so not axiomatizable by any computably enumerable set of sentences). By Tarski's theorem, the multiplicative ordered structure of mathbbR is decidable also; here we prove this result directly and present an axiomatization. The structure of mathbbQ in the language of order and multiplication seems to be missing in the literature; here 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.












This page was built for publication: On decidability and axiomatizability of some ordered structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2318170)