Inverse Semigroups with Countable Universal Semilattices

Karl Byleen
Additional contact information
Karl Byleen: Marquette University, Department of Mathematics, Statistics and Computer Science

A chapter in Semigroups and Their Applications, 1987, pp 37-42 from Springer

Abstract: 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.

Keywords: Boolean Algebra; Inverse Semigroup; Regular Semigroup; Amalgamation Property; Inverse Subsemigroup (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-3839-7_4

Ordering information: This item can be ordered from
http://www.springer.com/9789400938397

DOI: 10.1007/978-94-009-3839-7_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().