Stable embeddedness and NIP
classification
🧮 math.LO
keywords
embeddedstablycasecompleteconditionsdefinableembeddednessfinite
read the original abstract
We give sufficient conditions for a predicate P in a complete theory T to be stably embedded: P with its induced 0-definable structure has "finite rank", P has NIP in T and P is 1-stably embedded. This generalizes recent work by Hasson and Onshuus in the case where P is o-minimal in T.
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.