Let $α$ and $β$ belong to the same quadratic field. We show that the inhomogeneous Beatty sequence $(\lfloor n α+ β\rfloor)_{n \geq 1}$ is synchronized, in the sense that there is a finite automaton that takes as input the Ostrowski representations of $n$ and $y$ in parallel, and accepts if and only if $y = \lfloor n α+ β\rfloor$. Since it is already known that the addition relation is computable for Ostrowski representations based on a quadratic number, a consequence is a new and rather simple proof that the first-order logical theory of these sequences with addition is decidable. The decision procedure is easily implemented in the free software Walnut. As an application, we show that for each $r \geq 1$ it is decidable whether the set $\{ \lfloor n α+ β\rfloor \, : \, n \geq 1 \}$ forms an additive basis (or asymptotic additive basis) of order $r$. Using our techniques, we also solve some open problems of Reble and Kimberling, and give an explicit characterization of a sequence of Hildebrand et al.

翻译：设 $α$ 和 $β$ 属于同一个二次域。我们证明非齐次贝蒂序列 $(\lfloor n α+ β\rfloor)_{n \geq 1}$ 是同步的，即存在一个有限自动机，并行接收 $n$ 和 $y$ 的奥斯特罗夫斯基表示作为输入，当且仅当 $y = \lfloor n α+ β\rfloor$ 时接受。由于已知基于二次数的奥斯特罗夫斯基表示上的加法关系是可计算的，由此可得一个新颖且较为简单的证明：这些序列带加法的一阶逻辑理论是可判定的。该判定过程可轻松在免费软件 Walnut 中实现。作为应用，我们证明对于每个 $r \geq 1$，集合 $\{ \lfloor n α+ β\rfloor \, : \, n \geq 1 \}$ 是否构成 $r$ 阶加法基（或渐近加法基）是可判定的。利用我们的技术，我们还解决了 Reble 和 Kimberling 的一些公开问题，并给出了 Hildebrand 等人一个序列的显式刻画。