Skip to main content
Log in

On Homogeneous Semilattices and Their Automorphism Groups

  • Published:
Order Aims and scope Submit manuscript

Abstract

We show that there are just countably many countable homogeneous semilattices and give an explicit description of them. For the countable universal homogeneous semilattice we show that its automorphism group has a largest proper nontrivial normal subgroup.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Adeleke, S. A. and Neumann, P. M. (1998) Relations related to betweenness: Their structure and automorphisms, Mem. Amer. Math. Soc. 623.

  2. Albert, M. H. and Burris, S. N. (1986) Finite axiomatizations for existentially closed posets and semilattices, Order 3, 169–178.

    Google Scholar 

  3. Chang, C. C. and Keisler, H. J. (1990) Model Theory, 3rd edn, North-Holland, Amsterdam.

    Google Scholar 

  4. Cherlin, G. (1998) The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments, Mem. Amer. Math. Soc. 621.

  5. Droste, M. (1992) Finite axiomatizations of universal domains, J. Logic Comput. 2, 119–131.

    Google Scholar 

  6. Droste, M. (1985) Structure of partially ordered sets with transitive automorphism groups, Mem. Amer. Math. Soc. 57.

  7. Droste, M., Giraudet, M., Macpherson, D. and Sauer, N. (1994) Set-homogeneous graphs, J. Combin. Theory, Ser. B 62, 63–95.

    Google Scholar 

  8. Droste, M., Holland, W. C. and Macpherson, D. (1989) Automorphism groups of infinite semilinear orders (I) and (II), Proc. London Math. Soc. (3) 58, 454–478 and 479–494.

    Google Scholar 

  9. Fraissé, R. (1986) Theory of Relations, North-Holland, Amsterdam.

    Google Scholar 

  10. Glass, A. M.W. (1981) Ordered Permutation Groups, London Math. Soc. Lecture Notes Series 55, Cambridge University Press.

  11. Glass, A. M. W., McCleary, S. H. and Rubin, M. (1993) Automorphism groups of countable highly homogeneous partially ordered sets, Math. Z. 214, 55–66.

    Google Scholar 

  12. Higman, G. (1954) On infinite simple permutation groups, Publ. Math. Debrecen 3, 221–226.

    Google Scholar 

  13. Holland, W. C. (1963) The lattice-ordered group of automorphisms of an ordered set, Michigan Math J. 10, 399–408.

    Google Scholar 

  14. Lachlan, A. H. and Woodrow, R. E. (1980) Countable ultrahomogeneous undirected graphs, Trans. Amer. Math. Soc. 262, 51–94.

    Google Scholar 

  15. Lachlan, A. H. (1984) Countable homogeneous tournaments, Trans. Amer. Math. Soc. 284, 431–461.

    Google Scholar 

  16. Lloyd, J. T. (1964) Lattice-ordered groups and 0-permutation groups, PhD Thesis, Tulane University, New Orleans.

    Google Scholar 

  17. Ronse, C. (1978) On homogenous graphs, J. London Math. Soc. (2) 17, 375–379.

    Google Scholar 

  18. Ryll-Nardzewski, C. (1959) On categoricity in power ≤ ℵ0, Bull. Polish Acad. Sci. Ser. Math. Astronom. Phys. 7, 545–548.

    Google Scholar 

  19. Schmerl, J. (1979) Countable homogeneous partially ordered sets, Algebra Universalis 9, 317–321.

    Google Scholar 

  20. Truss, J. (1985) The group of the countable universal graph, Math. Proc. Cambridge Philos. Soc. 98, 213–245.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Droste, M., Kuske, D. & Truss, J.K. On Homogeneous Semilattices and Their Automorphism Groups. Order 16, 31–56 (1999). https://doi.org/10.1023/A:1006365012997

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1006365012997

Navigation