independence theorem
Recently Published Documents


TOTAL DOCUMENTS

24
(FIVE YEARS 0)

H-INDEX

5
(FIVE YEARS 0)

2014 ◽  
Vol 79 (01) ◽  
pp. 135-153 ◽  
Author(s):  
ITAÏ BEN YAACOV ◽  
ARTEM CHERNIKOV

Abstract 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 from stable 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.


2003 ◽  
Vol 40 (1-2) ◽  
pp. 1-12 ◽  
Author(s):  
G. Grätzer ◽  
E. T. Schmidt

Let D be a finite distributive lattice with more than one element and let G be a finite group. We prove that there exists a modular (arguesian) lattice M such that the congruence lattice of M is isomorphic to D and the automorphism group of M is isomorphic to G.


2000 ◽  
Vol 65 (4) ◽  
pp. 1481-1490 ◽  
Author(s):  
Ziv Shami

In 1978 Shelah introduced a new class of theories, called simple (see [Shi]) which properly contained the class of stable theories. Shelah generalized part of the theory of forking to the simple context. After approximately 15 years of neglecting the general theory (although there were works by Hrushovski on finite rank with a definability assumption, as well as deep results on specific simple theories by Cherlin, Hrushovski, Chazidakis, Macintyre and Van den dries, see [CH], [CMV], [HP1], [HP2], [ChH]) there was a breakthrough, initiated with the work of Kim ([K1]). Kim proved that almost all the technical machinery of forking developed in the stable context could be generalized to simple case. However, the theory of multiplicity (i.e., the description of the (bounded) set of non forking extensions of a given complete type) no longer holds in the context of simple theories. Indeed, by contrast to simple theories, stable theories share a strong amalgamation property of types, namely if p and q are two “free” complete extensions over a superset of A, and there is no finite equivalence relation over A which separates them, then the conjunction of p and q is consistent (and even free over A.) In [KP] Kim and Pillay proved a weak version of this property for any simple theory, namely “the Independence Theorem for Lascar strong types”. This was a weaker version both because of the requirement that the sets of parameters of the types be mutually independent, as well as the use of Lascar strong types instead of the usual strong types. A very fundamental and interesting problem is whether the independence theorem can be proved for any simple theory, using only the usual strong types. In 1997 Buechler proved ([Bu]) the strong-type version of the independence theorem for an important subclass of simple theories, namely the class of low theories (which includes the class of stable theories and the class of supersimple theories of finite D-rank.)


Sign in / Sign up

Export Citation Format

Share Document