Hostname: page-component-8448b6f56d-dnltx Total loading time: 0 Render date: 2024-04-24T15:29:21.599Z Has data issue: false hasContentIssue false

The ⊰-order on submodels

Published online by Cambridge University Press:  12 March 2014

Leo Marcus*
Affiliation:
Hebrew University, Jerusalem, Israel

Extract

The relation M 1M 2, where M 1 and M 2 are elementary submodels of a given model M, defines a partial ordering ⊰(M). A natural question is: What are the general properties of this ordering and what special properties can it have for given M? Here we give an example of a prime model M for which ⊰(M) is a dense linear order, in particular ⊰(M) is isomorphic to the natural order of (− ∞, ∞], the reals with a last element (Theorem 1). In fact, this is the only way for ⊰(M) to be a linear order when M is prime (Theorem 3).

We then remark that if N is a model of an ℵ0-categorical theory then ⊰(N) cannot be a linear order, but we give an example where ⊰(N) is a dense partial order, N a model of an ℵ0-categorical theory.

Independently, and about the same time, Benda [1] found nonprime models M where ⊰(M) is isomorphic to any one of a large class of orders, including (− ∞, ∞]. His methods are very similar to ours.

Notation. We assume the reader is familar with Vaught [2] where he will find the definitions and standard results pertaining to prime models, homogeneous models, and ℵ0-categorical theories.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1976

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Benda, M., Construction of models from groups of permutations (preprint).Google Scholar
[2] Vaught, R. L., Denumerable models of complete theories, Infinitistic methods, Pergamon Press, New York, 1961, pp. 303321.Google Scholar