Closed sets and chain conditions in stable theories
Authors:
- 1 December 1984
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 49 (4) , 1350-1362
Abstract
An impressive theory has been developed, largely by Shelah, around the notion of a stable theory. This includes detailed structure theorems for the models of such theories as well as a generalized notion of independence. The various stability properties can be defined in terms of the numbers of types over sets, or in terms of the complexity of definable sets. In the concrete examples of stable theories, however, one finds an important distinction between “positive” and “negative” information, such a distinction not being an a priori consequence of the general definitions. In the naive examples this may take the form of distinguishing between say a class of a definable equivalence relation and the complement of a class. In the more algebraic examples, this distinction may have a “topological” significance, for example with the Zariski topology on (the set of n-tuples of) an algebraically closed field, the “closed” sets being those given by sets of polynomial equalities. Note that in the latter case, every definable set is a Boolean combination of such closed sets (the definable sets are precisely the constructible sets). Similarly, stability conditions in practice reduce to chain conditions on certain “special” definable sets (e.g. in modules, stable groups). The aim here is to develop and present such notions in the general (model-theoretic) context. The basic notion is that of an “equation”. Given a complete theory T in a language L, an L-formula φ(x̄, ȳ) is said to be an equation (in x̄) if any collection Φ of instances of φ(i.e. of formulae φ(x̄, ā)) is equivalent to a finite subset Φ′ ⊂ Φ.Keywords
This publication has 6 references indexed in Scilit:
- Anand Pillay. An introduction to stability theory. Oxford logic guides, no. 8. Clarendon Press, Oxford University Press, Oxford and New York 1983, xi + 146 pp.The Journal of Symbolic Logic, 1986
- Fundamentals of forkingAnnals of Pure and Applied Logic, 1984
- Model theory of modulesAnnals of Pure and Applied Logic, 1984
- Countable models of stable theoriesProceedings of the American Mathematical Society, 1983
- Forking and Pushouts in ModulesProceedings of the London Mathematical Society, 1983
- Two conjectures regarding the stability of ω-categorical theoriesFundamenta Mathematicae, 1973