Hostname: page-component-5d59c44645-zlj4b Total loading time: 0 Render date: 2024-03-03T02:11:23.812Z Has data issue: false hasContentIssue false

Rigid homogeneous chains

Published online by Cambridge University Press:  24 October 2008

A. M. W. Glass
Bowling Green State University, Bowling Green, Ohio 43403U.S.A.
Yuri Gurevich
Ben-Gurion University of the Negev, Beer-Sheva, Israel.
W. Charles Holland
Bowling Green State University, Bowling Green, Ohio 43403U.S.A.
Saharon Shelah
The Hebrew University, Jerusalem, Israel


Classifying (unordered) sets by the elementary (first order) properties of their automorphism groups was undertaken in (7), (9) and (11). For example, if Ω is a set whose automorphism group, S(Ω), satisfies

then Ω has cardinality at most ℵ0 and conversely (see (7)). We are interested in classifying homogeneous totally ordered sets (homogeneous chains, for short) by the elementary properties of their automorphism groups. (Note that we use ‘homogeneous’ here to mean that the automorphism group is transitive.) This study was begun in (4) and (5). For any set Ω, S(Ω) is primitive (i.e. has no congruences). However, the automorphism group of a homogeneous chain need not be o-primitive (i.e. it may have convex congruences). Fortunately, ‘o-primitive’ is a property that can be captured by a first order sentence for automorphisms of homogeneous chains. Hence our general problem falls naturally into two parts. The first is to classify (first order) the homogeneous chains whose automorphism groups are o-primitive; the second is to determine how the o-primitive components are related for arbitrary homogeneous chains whose automorphism groups are elementarily equivalent.

Research Article
Copyright © Cambridge Philosophical Society 1981

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.)


(1)Baumgartner, J. E.All ℵ1-dense sets of reals can be isomorphic. Fund. Math. 79 (1973), 101106.Google Scholar
(2)Dushnik, B. and Miller, E. W.Concerning similarity transformations of linearly ordered sets. Bull. Amer. Math. Soc. 46 (1940), 322326.Google Scholar
(3)Glass, A. M. W.Ordered Permutation Groups, Bowling Green State University, Bowling Green, Ohio, 1976.1Google Scholar
(4)Gurevich, Y. and Holland, W. Charles.Recognizing the real line. Trans. Amer. Math. Soc. (To appear).Google Scholar
(5)Jambu-Giraudet, M. Théorie des modèles de groupes d'automorphisms d'ensembles totalement ordonnés, Thèse 3ème cycle, Université Paris VII, 1979.Google Scholar
(6)Jech, T. J.Lectures in Set Theory with Particular Emphasis on the Method of Forcing. Springer Lecture Notes 217, 1971.Google Scholar
(7)Mckenzie, R.On elementary types of symmetric groups. Algebra Universalis, 1 (1971), 1320.Google Scholar
(8)Ohkuma, T.Sur quelques ensembles ordonnés linéairement. Fund. Math. 43 (1955), 326337.Google Scholar
(9)Pinus, A. G.On elementary definability of symmetric groups and lattices of equivalences. Algebra Universalis, 3 (1973), 5966.Google Scholar
(10)Robinson, A. and Zakon, E.Elementary properties of ordered abelian groups. Trans. Amer. Math. Soc. 96 (1960), 222236.Google Scholar
(11)Shelah, S.First order theory of permutation groups. Israel J. Math. 14 (1973), 149162; 15 (1973), 437–441.Google Scholar
(12)Szmielew, W.Elementary properties of abelian groups. Fund. Math. 41 (1955), 203271.Google Scholar