DeepAI AI Chat
Log In Sign Up

On the Decidability of the Ordered Structures of Numbers

by   Ziba Assadi, et al.
Chargoon Co.

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 N and Z are not decidable (and so not axiomatizable by any computably enumerable set of sentences). By Tarski's theorem, the multiplicative ordered structure of R is decidable also; here we prove this result directly and present an axiomatization. The structure of Q 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.


page 1

page 2

page 3

page 4


Decidability of the Multiplicative and Order Theory of Numbers

The ordered structures of natural, integer, rational and real numbers ar...

Axiomatic (and Non-Axiomatic) Mathematics

Axiomatizing mathematical structures and theories is an objective of Mat...

Fusible numbers and Peano Arithmetic

Inspired by a mathematical riddle involving fuses, we define the "fusibl...

Models of VTC^0 as exponential integer parts

We prove that (additive) ordered group reducts of nonstandard models of ...

Presenting Quantitative Inequational Theories

It came to the attention of myself and the coauthors of (S., Rozowski, S...

Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures

We present algorithms for generating alternative solutions for explicit ...

Iterated multiplication in VTC^0

We show that VTC^0, the basic theory of bounded arithmetic corresponding...