Enriching a predicate and tame expansions of the integers
Abstract
Given a structure and a stably embedded -definable set , we prove tameness preservation results when enriching the induced structure on by some further structure . In particular, we show that if and are stable (resp., superstable, -stable), then so is the theory of the enrichment of by . Assuming simplicity of , elimination of hyperimaginaries and a further condition on related to the behavior of algebraic closure, we also show that simplicity and NSOP pass from to . 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 . More generally, we show that any stable (resp., superstable, simple, NIP, NTP, NSOP) countable graph can be defined in a stable (resp., superstable, simple, NIP, NTP, NSOP) expansion of by some unary predicate .
Cite
@article{arxiv.2203.07226,
title = {Enriching a predicate and tame expansions of the integers},
author = {Gabriel Conant and Christian d'Elbée and Yatir Halevi and Léo Jimenez and Silvain Rideau-Kikuchi},
journal= {arXiv preprint arXiv:2203.07226},
year = {2023}
}