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 can be defined in the structure . This result is achieved by obtaining a topological characterization of -definable relations in the family of -definable relations and then by following Muchnik's approach of showing that the characterization of the relation can be expressed in the logic of . The above characterization allows us to prove that there is no intermediate structure between and . We also show that a -definable relation is -definable if and only if its intersection with every -definable line is -definable. This gives a noneffective but simple characterization of -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}
}