A Cobham theorem for scalar multiplication
Logic
2024-07-23 v1 Logic in Computer Science
Abstract
Let be such that are quadratic and . Then every subset of definable in both and is already definable in . As a consequence we generalize Cobham-Semenov theorems for sets of real numbers to -numeration systems, where is a quadratic irrational.
Cite
@article{arxiv.2407.15118,
title = {A Cobham theorem for scalar multiplication},
author = {Philipp Hieronymi and Sven Manthe and Chris Schulz},
journal= {arXiv preprint arXiv:2407.15118},
year = {2024}
}