2000 character limit reached
A Cobham theorem for scalar multiplication
Published 21 Jul 2024 in math.LO and cs.LO | (2407.15118v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.