arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.00070math.LO
收藏

自动机与$(\mathbb{Z},+)$的驯服展开

Automata and tame expansions of $(\mathbb{Z},+)$

Christopher D. C. Hawthorne

摘要:

问题的特点,自动集的整数是稳定的,在这里解决。给定一个正整数$d$和一个子集$A\subseteq \mathbb{Z}$,其表示基$d$的集合被一个有限自动机所识别,得到了$x+y\in A$是$\operatorname{Th}(\mathbb{Z},+,A)$中稳定公式的一个必要条件.结合Moosa和Scanlon的一个定理,给出了$d$的一个组合特征-自动$A\subseteq \mathbb{Z}$,使得$(\mathbb{Z},+,A)$是稳定的.这个特征是根据Moosa和Scanlon所称的“$F$ -集合”和Derksen所称的“初等$p$ -嵌套集合”。自动机理论的方法也被用来产生一些NIP扩展的$(\mathbb{Z},+)$,特别是扩展的幺半群$(d^\mathbb{N},\times )$。

英文摘要:

The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a necessary condition is found for $x+y\in A$ to be a stable formula in $\operatorname{Th}(\mathbb{Z},+,A)$. Combined with a theorem of Moosa and Scanlon this gives a combinatorial characterization of the $d$-automatic $A\subseteq \mathbb{Z}$ such that $(\mathbb{Z},+,A)$ is stable. This characterization is in terms of what were called "$F$-sets" by Moosa and Scanlon and "elementary $p$-nested sets" by Derksen. Automata-theoretic methods are also used to produce some NIP expansions of $(\mathbb{Z},+)$, in particular the expansion by the monoid $(d^\mathbb{N},\times )$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑