Hostname: page-component-76c49bb84f-7l7zb Total loading time: 0 Render date: 2025-07-09T18:50:42.054Z Has data issue: false hasContentIssue false
  • English
  • Français

Groups of order automorphisms of ordered sets

Published online by Cambridge University Press:  26 February 2010

P. M. Cohn
P. M. Cohn
Affiliation:
The University, Manchester 13.
Get access

Extract

Let S be an ordered set, i.e. a set with a transitive irreflexive binary relation “<” such that, for any a, bεS, either a = b or a < b or b < a. By an order automorphism of S we mean a one-one mapping α of S onto itself such that

Information

Type
Research Article
Information
Mathematika , Volume 4 , Issue 1 , June 1957 , pp. 41 - 50
Copyright
Copyright © University College London 1957

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

Article purchase

Temporarily unavailable

References

1.Birkhoff, G., Lattice theory (2nd ed., New York, 1948).Google Scholar
2.Iwasawa, K., “On linearly ordered groups”, J. Math. Soc. Japan, 1 (1948), 1–9.CrossRefGoogle Scholar
3.Neumann, B. H., “On ordered groups”, American J. Math., 71 (1949), 1–18.CrossRefGoogle Scholar