arXiv Analytics

Sign in

arXiv:2203.07226 [math.LO]AbstractReferencesReviewsResources

Enriching a predicate and tame expansions of the integers

Gabriel Conant, Christian d'Elbée, Yatir Halevi, Léo Jimenez, Silvain Rideau-Kikuchi

Published 2022-03-14Version 1

Given a structure $\mathcal{M}$ and a stably embedded $\emptyset$-definable set $Q$, we prove tameness preservation results when enriching the induced structure on $Q$ by some further structure $\mathcal{Q}$. In particular, we show that if $T=\text{Th}(\mathcal{M})$ and $\text{Th}(\mathcal{Q})$ are stable (resp., superstable, $\omega$-stable), then so is the theory $T[\mathcal{Q}]$ of the enrichment of $\mathcal{M}$ by $\mathcal{Q}$. Assuming stability of $T$ and a further condition on $Q$ related to the behavior of algebraic closure, we also show that simplicity and NSOP$_1$ pass from $\text{Th}(\mathcal{Q})$ to $T[\mathcal{Q}]$. We then prove several applications for tame expansions of weakly minimal structures and, in particular, the group of integers. For example, we construct the first known examples of strictly stable expansions of $(\mathbb{Z},+)$. More generally, we show that any stable (resp., superstable, simple, NIP, NTP$_2$, NSOP$_1$) countable graph can be defined in a stable (resp., superstable, simple, NIP, NTP$_2$, NSOP$_1$) expansion of $(\mathbb{Z},+)$ by some unary predicate $A\subseteq \mathbb{N}$.

Related articles: Most relevant | Search more
arXiv:math/9809202 [math.LO] (Published 1998-09-15)
Universal graphs with forbidden subgraphs and algebraic closure
arXiv:1404.4549 [math.LO] (Published 2014-04-17, updated 2014-09-11)
A Sheaf Model of the Algebraic Closure
arXiv:2007.00070 [math.LO] (Published 2020-06-30)
Automata and tame expansions of $(\mathbb{Z},+)$