×

Dependent first order theories, continued. (English) Zbl 1195.03040

This paper continues the investigation, started in [S. Shelah, Sci.Math.Jpn.59, No.2, 265–316 (2004; Zbl 1081.03031)], of first-order theories without the dependence property (i.e., dependent theories). It is written in the author’s characteristic style.
In the first section, it is shown that if we expand a model of a dependent theory with quantifier elimination by all traces of sets definable in a (sufficiently saturated) elementary extension, the resulting structure still allows quantifier elimination. In particular it is still dependent. A far more readable account of this result is given by A. Pillay [in: B. Löwe (ed.), Algebra, logic, set theory. Festschrift für Ulrich Felgner zum 65.Geburtstag. London: King’s College Publications. Studies in Logic (London) 4, 175–181 (2007; Zbl 1135.03337)], and a stronger result was shown by A. Chernikov and P. Simon [arXiv:1007.4468v1].
In the second section, the author gives examples to show that the cofinality restrictions in Section 5 of his paper above are necessary.
In the third section, the author studies strongly dependent theories: \(T\) is strongly dependent if for some infinite \(\kappa\) in no model there are formulas \((\varphi_n(\bar x,\bar y):n<\omega)\) and tuples \((\bar a^n_\alpha:n<\omega,\alpha<\kappa)\) such that for all \(\eta\in{}^\omega\kappa\) the set
\[ p_\eta(\bar x)=\{\varphi_n(\bar x,\bar a^n_{\eta(\alpha)}):n<\omega\}\cup\{\neg\varphi_n(\bar x,\bar a^n_\alpha):n<\omega,\;\alpha\not=\eta(n)\} \]
is consistent. In this case, \(\kappa_{\text{ict}}(T)\) is the minimal \(\kappa\) with this property. If in addition we require all the \(p_\eta\) to be consistent with some type \(q\), this is called the burden of \(q\) by H. Adler [Strong theories, burden, and weight. Preprint (2007)] and generalizes the notion of weight for a type in a stable theory. The author shows that in a strongly dependent theory there are no non-algebraic types \(p\) and \(q\) such that for any countable set \(A\) of realizations of \(p\) there is \(b\) realizing \(q\) algebraising \(B\) (Shelah calls \((p,q)\) a \((1=\aleph_0)\)-pair, a terminology which I feel should be avoided). The study of strongly dependent theories will be continued in [Strongly dependent theories. Preprint].
In the fourth section, is is shown that a dependent group with an infinite abelian subgroup contains a definable abelian subgroup. This was generalized by R. de Aldama in his thesis [Chaînes et dépendance. Lyon (2009)] to the nilpotent case; moreover he shows that the definable group actually contains the given one.
In the fifth section, the author studies forking in the dependent context. He defines explicit dividing and forking, strong splitting, exact forking, strict non-dividing (negated as strict dividing), strict forking, strict non-forking (which is not the negation of strict forking) and shows various properties.

MSC:

03C45 Classification theory, stability, and related concepts in model theory

References:

[1] Y. Baisalov and B. Poizat, Paires de structures o-minimales, Journal of Symbolic Logic 63 (1998), 570–578. · Zbl 0910.03025 · doi:10.2307/2586850
[2] B. Baizhanov, J. Baldwin and S. Shelah, Subsets of superstable structures are weakly benign, Journal of Symbolic Logic 70 (2005), 142–150, math.LO/0303324. · Zbl 1089.03026 · doi:10.2178/jsl/1107298514
[3] J. T. Baldwin and M. Benedikt, Stability theory, permutations of indiscernibles, and embedded finite model theory, Transactions of the American Mathematical Society 352 (2000), 4937–4969. · Zbl 0960.03027 · doi:10.1090/S0002-9947-00-02672-6
[4] M. Cohen and S. Shelah, Stable theories and representation over sets, preprint. · Zbl 1412.03015
[5] W. W. Comfort, Ultrafilters: some old and some new results, Bulletin of the American Mathematical Society 83 (1977), 417–455. · Zbl 0355.54005 · doi:10.1090/S0002-9904-1977-14316-4
[6] E. Firstenberg and S. Shelah, Pseudo unidimensional dependent theories. For more information please contact the author.
[7] J. H. Keisler, Measures and forking, Annals of Pure and Applied Logic 34 (1987),119–169. · Zbl 0633.03024 · doi:10.1016/0168-0072(87)90069-8
[8] B. Poizat, Théories instables, Journal of Symbolic Logic 46 (1981), 513–522. · Zbl 0473.03027 · doi:10.2307/2273753
[9] S. Shelah, Finite diagrams stable in power, Annals of Mathematical Logic 2 (1970), 69–118. · Zbl 0204.31104 · doi:10.1016/0003-4843(70)90007-0
[10] S. Shelah, Simple unstable theories, Annals of Mathematical Logic 19 (1980), 177–203. · Zbl 0489.03008 · doi:10.1016/0003-4843(80)90009-1
[11] S. Shelah, Classification theory and the number of nonisomorphic models, in Studies in Logic and the Foundations of Mathematics, vol. 92, North-Holland Publishing Co., Amsterdam, xxxiv+705 pp., 1990. · Zbl 0713.03013
[12] S. Shelah, Classification theory for elementary classes with the dependence property – a modest beginning, Scientiae Mathematicae Japonicae 59,No. 2; (special issue: e9, 503–544) (2004), 265–316, math.LO/0009056. · Zbl 1081.03031
[13] S. Shelah, Minimal bounded index subgroup for dependent theories, Proceedings of the American Mathematical Society 136 (2008), 1087–1091. · Zbl 1144.03026 · doi:10.1090/S0002-9939-07-08654-6
[14] S. Shelah, Stable frames and weight.
[15] S. Shelah, Strongly dependent theories, submitted. · Zbl 1371.03043
[16] S. Shelah, Dependent T and Existence of limit models, preprint, math. LO/0609636. · Zbl 1335.03033
[17] S. Shelah, Definable groups for dependent and 2-dependent theories, submitted.
[18] S. Shelah, Dependent theories and the generic pair conjecture, Communications in Contemporary Mathematics, submitted, math.LO/0702292 · Zbl 1338.03065
[19] S. Shelah, A dependent dream and recounting types, preprint.
[20] S. Shelah, Toward the main gap by fatness, a modest beginning.
[21] S. Shelah, Representation over orders of elementary classes.
[22] S. Shelah, On incompctness in singulars (for Ext, consistently incompact).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.