English

Theories of real addition with and without a predicate for integers

Logic in Computer Science 2023-06-22 v4 Logic

Abstract

We show that it is decidable whether or not a relation on the reals definable in the structure R,+,<,Z\langle \mathbb{R}, +,<, \mathbb{Z} \rangle can be defined in the structure R,+,<,1\langle \mathbb{R}, +,<, 1 \rangle. This result is achieved by obtaining a topological characterization of R,+,<,1\langle \mathbb{R}, +,<, 1 \rangle-definable relations in the family of R,+,<,Z\langle \mathbb{R}, +,<, \mathbb{Z} \rangle-definable relations and then by following Muchnik's approach of showing that the characterization of the relation XX can be expressed in the logic of R,+,<,1,X\langle \mathbb{R}, +,<,1, X \rangle. The above characterization allows us to prove that there is no intermediate structure between R,+,<,Z\langle \mathbb{R}, +,<, \mathbb{Z} \rangle and R,+,<,1\langle \mathbb{R}, +,<, 1 \rangle. We also show that a R,+,<,Z\langle \mathbb{R}, +,<, \mathbb{Z} \rangle-definable relation is R,+,<,1\langle \mathbb{R}, +,<, 1 \rangle-definable if and only if its intersection with every R,+,<,1\langle \mathbb{R}, +,<, 1 \rangle-definable line is R,+,<,1\langle \mathbb{R}, +,<, 1 \rangle-definable. This gives a noneffective but simple characterization of R,+,<,1\langle \mathbb{R}, +,<, 1 \rangle-definable relations.

Keywords

Cite

@article{arxiv.2002.04282,
  title  = {Theories of real addition with and without a predicate for integers},
  author = {Alexis Bès and Christian Choffrut},
  journal= {arXiv preprint arXiv:2002.04282},
  year   = {2023}
}