论文信息 - Generalized amalgamation and n-simplicity

Generalized amalgamation and n-simplicity

Abstract We study generalized amalgamation properties in simple theories. We formulate a notion of generalized amalgamation in such a way so that the properties are preserved when we pass from T to T e q or T h e q ; we provide several equivalent ways of formulating the notion of generalized amalgamation. We define two distinct hierarchies of simple theories characterized by their amalgamation properties; examples are given to show the difference between the hierarchies.

Akito Tsuboi | Byunghan Kim | Alexei S. Kolesnikov

[1] Ehud Hrushovski,et al. Model theory of difference fields , 1999 .

[2] Byunghan Kim. Simplicity, and Stability in There , 2001, J. Symb. Log..

[3] W. Hodges. CLASSIFICATION THEORY AND THE NUMBER OF NON‐ISOMORPHIC MODELS , 1980 .

[4] Anand Pillay,et al. Forking and Fundamental Order in Simple Theories , 1999, J. Symb. Log..

[5] Saharon Shelah. ON WHAT I DO NOT UNDERSTAND (AND HAVE SOMETHING TO SAY), MODEL THEORY , 1999 .

[6] Alexei S. Kolesnikov. n-Simple theories , 2005, Ann. Pure Appl. Log..

[7] Jessica Millar,et al. Constructing the hyperdefinable Group from the Group Configuration , 2006, J. Math. Log..

[8] Anand Pillay,et al. Simple Theories , 1997, Ann. Pure Appl. Log..

[9] Ludomir Newelski. Very simple theories without forking , 2003, Arch. Math. Log..

[10] Saharon Shelah. Simple unstable theories , 1980 .

[11] Byunghan Kim. Forking in Simple Unstable Theories , 1998 .

[12] Saharon Shelah,et al. Classification theory for non-elementary classes I: The number of uncountable models ofψ ∈Lω_1, ω. Part A , 1983 .

[13] Itay Ben-Yaacov,et al. The group configuration in simple theories and its applications , 2002, Bull. Symb. Log..