Enriching a predicate and tame expansions of the integers
Abstract
Given a structure M and a stably embedded -definable set Q, we prove tameness preservation results when enriching the induced structure on Q by some further structure Q. In particular, we show that if T=Th(M) and Th(Q) are stable (resp., superstable, ω-stable), then so is the theory T[Q] of the enrichment of M by Q. Assuming simplicity of T, elimination of hyperimaginaries and a further condition on Q related to the behavior of algebraic closure, we also show that simplicity and NSOP1 pass from Th(Q) to T[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 (Z,+). More generally, we show that any stable (resp., superstable, simple, NIP, NTP2, NSOP1) countable graph can be defined in a stable (resp., superstable, simple, NIP, NTP2, NSOP1) expansion of (Z,+) by some unary predicate A⊂eqN.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.