An independence theorem for NTP2 theories
- Author(s): Yaacov, IB
- Chernikov, A
- et al.
Published Web Locationhttps://doi.org/10.1017/jsl.2013.22
© 2014, Association for Symbolic Logic We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain condition over extension bases (namely, the forking ideal is S1, in Hrushovski’s terminology). Using it we prove an independence theorem over extension bases (which, in the case of simple theories, specializes to the ordinary independence theorem). As an application we show that Lascar strong type and compact strong type coincide over extension bases in an NTP2 theory. We also define the dividing order of a theory—a generalization of Poizat’s fundamental order fromstable theories—and give some equivalent characterizations under the assumption of NTP2. The last section is devoted to a refinement of the class of strong theories and its place in the classification hierarchy.
Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.