Skip to main content
SpringerLink
Log in

On linearly ordered sets and permutation groups of countable degree

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Carruth, P.W.: Arithmetic of ordinals with applications to the theory of ordered abelian groups. Bull. Am. Math. Soc.48, 262–271 (1942)

    Google Scholar 

  2. Laver, R.: On Fraïssé's order type conjecture. Ann. Math.93, 89–111 (1971)

    Google Scholar 

  3. Neumer, W.: Über Mischsummen von Ordnungszahlen. Arch. Math.5, 244–248 (1954)

    Google Scholar 

  4. Shelah, S., Thomas, S.: Implausible subgroups of infinite symmetric groups (preprint, 1987)

Download references

Author information

Authors and Affiliations

  1. Mathematikdepartment, E.T.H. Zürich, Rämistrasse 101, CH-8092, Zürich, Switzerland

    Hans Läuchli

  2. The Queen's College, OX1 4AW, Oxford, UK

    Peter M. Neumann

Authors
  1. Hans Läuchli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter M. Neumann
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Our thanks go to the Forschungsinstitut für Mathematik of the ETH, Zürich, which enabled us to do this joint work, and to the referee for his comments on the first version.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Läuchli, H., Neumann, P.M. On linearly ordered sets and permutation groups of countable degree. Arch Math Logic 27, 189–192 (1988). https://doi.org/10.1007/BF01620766

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01620766

Keywords

Search

Navigation