Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-19T05:35:09.029Z Has data issue: false hasContentIssue false

Stable embeddedness and NIP

Published online by Cambridge University Press:  12 March 2014

Anand Pillay*
Affiliation:
School of Mathematics, University of Leeds, Leeds, LS2 9JT, UK, E-mail: pillay@maths.leeds.ac.uk

Abstract

We give some sufficient conditions for a predicate P in a complete theory T to be “stably embedded”. Let be P with its “induced ∅-definable structure”. The conditions are that (or rather its theory) is “rosy”. P has NIP in T and that P is stably 1-embedded in T. This generalizes a recent result of Hasson and Onshuus [6] which deals with the case where P is o-minimal in T. Our proofs make use of the theory of strict nonforking and weight in NIP theories ([3], [10]).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable