2000 character limit reached
A Cobham theorem for scalar multiplication (2407.15118v1)
Published 21 Jul 2024 in math.LO and cs.LO
Abstract: Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \beta x)$ is already definable in $(\mathbb{R},{<},+,\mathbb{Z})$. As a consequence we generalize Cobham-Semenov theorems for sets of real numbers to $\beta$-numeration systems, where $\beta$ is a quadratic irrational.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.