Skip to main content Accessibility help
×
Home

Vaught's conjecture for o-minimal theories

  • Laura L. Mayer (a1)

Extract

The notion of o-minimality was formulated by Pillay and Steinhorn [PS] building on work of van den Dries [D]. Roughly speaking, a theory T is o-minimal if whenever M is a model of T then M is linearly ordered and every definable subset of the universe of M consists of finitely many intervals and points. The theory of real closed fields is an example of an o-minimal theory.

We examine the structure of the countable models for T, T an arbitrary o-minimal theory (in a countable language). We completely characterize these models, provided that T does not have 2ω countable models. This proviso (viz. that T has fewer than 2ω countable models) is in the tradition of classification theory: given a cardinal α, if T has the maximum possible number of models of size α, i.e. 2α, then no structure theorem is expected (cf. [Sh1]).

O-minimality is introduced in §1. §1 also contains conventions and definitions, including the definitions of cut and noncut. Cuts and noncuts constitute the nonisolated types over a set.

In §2 we study a notion of independence for sets of nonisolated types and the corresponding notion of dimension.

In §3 we define what it means for a nonisolated type to be simple. Such types generalize the so-called “components” in Pillay and Steinhorn's analysis of ω-categorical o-minimal theories [PS]. We show that if there is a nonisolated type which is not simple then T has 2ω countable models.

Copyright

References

Hide All
[Bo] Bouscaren, E., Martin's conjecture for ω-stable theories, Israel Journal of Mathematics, vol. 49 (1984), pp. 1525.
[D] Van Den Dries, L., Remarks on Tarski's problem concerning (R, +,·, exp), Logic Colloquium ’82 (Lolli, G.et al., editors), North-Holland, Amsterdam, 1984, pp. 97121.
[KPS] Knight, J., Pillay, A., and Steinhorn, C., Definable sets in ordered structures. II, Transactions of the American Mathematical Society, vol. 295 (1986), pp. 593605.
[L] Lachlan, A. H., The number of countable models of a countable superstable theory, Logic, methodology and philosophy of science. IV (Proceedings, Bucharest, 1971; Suppes, P.et al., editors), North-Holland, Amsterdam, 1973, pp. 4556.
[Ml] Marker, D., Omitting types in -minimal theories, this Journal, vol. 51 (1986), pp. 6374.
[M2] Marker, D., Vaught's conjecture for somewhat discrete -minimal theories, handwritten notes, University of California, Berkeley, California, 1986.
[Mi] Miller, A. W., Review of [Mo], this Journal, vol. 49 (1984), pp. 314315.
[Mo] Morley, M., The number of countable models, this Journal, vol. 35 (1970), pp. 1418.
[P] Pillay, A., Countable models of stable theories, preprint.
[PS] Pillay, A. and Steinhorn, C., Definable sets in ordered structures. I, Transactions of the American Mathematical Society, vol 295 (1986), pp. 565592.
[R] Rosenstein, J. G., Linear orderings, Academic Press, New York, 1982.
[Ru] Rubin, M., Theories of linear order, Israel Journal of Mathematics, vol. 17 (1974), pp. 392443.
[Sh1] Shelah, S., Classification theory and the number of non-isomorphic models, North-Holland, Amsterdam, 1978.
[Sh2] Shelah, S., End extensions and numbers of countable models, this Journal, vol. 43 (1978), pp. 550562.
[V] Vaught, R., Denumerable models of complete theories, Infinitistic methods (Proceedings, Warsaw, 1959), PWN, Warsaw, and Pergamon Press, Oxford, 1961, pp. 303321.
[Wl] Wagner, C. M., Martin's conjecture for trees, Abstracts of Papers Presented to the American Mathematical Society, vol. 2 (1981), p. 528 (abstract 81T-03-549).
[W2] Wagner, C. M., On Martin's conjecture, Annals of Mathematical Logic, vol. 22(1982), pp. 4767.

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed