Externally definable sets and dependent pairs
classification
🧮 math.LO
keywords
definabledependentexternallypairsprovesetstheoremanswers
read the original abstract
We prove that externally definable sets in first order NIP theories have honest definitions, giving a new proof of Shelah's expansion theorem. Also we discuss a weak notion of stable embeddedness true in this context. Those results are then used to prove a general theorem on dependent pairs, which in particular answers a question of Baldwin and Benedikt on naming an indiscernible sequence.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.