Abstract
It is shown that, for any given m and n with m < n (where n = ∞ is allowed), there is a group of order-preserving permutations of the rational numbers whose degrees of homogeneity and uniqueness are m and n, respectively. This is in contrast with the situation for the real numbers. The result is deduced from a more general theorem applying to a wide class of relational structures. The tools used are Fraïssé's theorem on homogeneous structures and a lemma of Tits. All the groups constructed are isomorphic to the free group of countable rank.
| Original language | English |
|---|---|
| Pages (from-to) | 163-171 |
| Number of pages | 9 |
| Journal | Journal of Mathematical Psychology |
| Volume | 33 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Jan 1989 |
Fingerprint
Dive into the research topics of 'Groups of order-automorphisms of the rationals with prescribed scale type'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver