关于联合性、可识别集和Cobham定理的注记
A note on syndeticity, recognizable sets and Cobham's theorem
摘要：
本文给出了下列结果的另一种证明。设p，q ≥ 2是两个乘法独立的整数.如果一个整数的无限集合是p-和q-可识别的，那么它是联合的。请注意，这一结果是需要在经典的证明著名的科巴姆？s定理。因此，本文的目的是完成[13]和[1]，以获得一个可访问的证明Cobham？s定理。
英文摘要：
In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is needed in the classical proof of the celebrated Cobham?s theorem. Therefore the aim of this paper is to complete [13] and [1] to obtain an accessible proof of Cobham?s theorem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
