Alexis Bès, Christian Choffrut. $\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $. In Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron, editors, Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings. Volume 12038 of Lecture Notes in Computer Science, pages 128-140, Springer, 2020. [doi]
@inproceedings{BesC20,
title = {$\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $},
author = {Alexis Bès and Christian Choffrut},
year = {2020},
doi = {10.1007/978-3-030-40608-0_8},
url = {https://doi.org/10.1007/978-3-030-40608-0_8},
researchr = {https://researchr.org/publication/BesC20},
cites = {0},
citedby = {0},
pages = {128-140},
booktitle = {Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings},
editor = {Alberto Leporati and Carlos Martín-Vide and Dana Shapira and Claudio Zandron},
volume = {12038},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-40608-0},
}