Stable embeddedness and NIP
Logic
2010-01-05 v1
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.
Keywords
Cite
@article{arxiv.1001.0515,
title = {Stable embeddedness and NIP},
author = {Anand Pillay},
journal= {arXiv preprint arXiv:1001.0515},
year = {2010}
}
Comments
10 pages