Skip to main content

Inverse Semigroups with Countable Universal Semilattices

  • Chapter
Semigroups and Their Applications
  • 147 Accesses

Abstract

A semilattice E is said to be a countable universal semilattice if E is countable and if every countable semilattice can be embedded in E. The free Boolean algebra on a countably infinite number of generators is used to construct a particular countable universal semilattice which is the semilattice of idempotents of a 2-generated bisimple monoid.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. L. Bell and A. B. Slomson, Models and ultraproducts: an introduction, North Holland, Amsterdam, 1971.

    Google Scholar 

  2. K. Byleen, ‘Embedding any countable semigroup in a 2-generated bisimple monoid’, Glasgow Math. J. 25 (1984), 153–161.

    Article  MathSciNet  MATH  Google Scholar 

  3. T. E. Hall, ‘Inverse and regular semigroups and amalgamation: a brief survey’, Proceedings of a Symposium on Regular Semi-Groups, Northern Illinois University, 1979.

    Google Scholar 

  4. T. Imaoka, ‘Free products with amalgamation of bands’, Mem. Fac. Lit. & Sci., Shimane Univ., Nat. Sci. 10 (1976), 7–17.

    MathSciNet  Google Scholar 

  5. B. Jónsson, universal relational systems’, Math. Scand. 4 (1956), 193–208.

    MathSciNet  MATH  Google Scholar 

  6. B. Jónsson, ‘Homogeneous universal relational systems’, Math. Scand. 8 (1960), 137–142.

    MathSciNet  MATH  Google Scholar 

  7. B. H. Neumann, ‘Some remarks on infinite groups’, J. London Math. Soc. 12 (1937), 120–127.

    Article  Google Scholar 

  8. M. Petrich, Inverse Semigroups, Wiley, New York, 1984.

    MATH  Google Scholar 

  9. N. R. Reilly, ‘Embedding inverse semigroups in bisimple inverse semigroups’, Quart. J. Math., Oxford (2) 16 (1965), 183–187.

    Article  MathSciNet  MATH  Google Scholar 

  10. R. Sikorski, Boolean algebras, Springer-Verlag, Berlin, 1964.

    MATH  Google Scholar 

  11. S. Willard, General topology, Addison-Wesley, Reading, 1970.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 D. Reidel Publishing Company

About this chapter

Cite this chapter

Byleen, K. (1987). Inverse Semigroups with Countable Universal Semilattices. In: Goberstein, S.M., Higgins, P.M. (eds) Semigroups and Their Applications. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-3839-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-3839-7_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-8209-9

  • Online ISBN: 978-94-009-3839-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics