2000 character limit reached
On the variety of strict pseudosemilattices (1301.5485v2)
Published 23 Jan 2013 in math.RA
Abstract: A new model, in terms of finite bipartite graphs, of the free pseudosemilattice is presented. This will then be used to obtain several results about the variety SPS of all strict pseudosemilattices: (i) an identity basis for SPS is found, (ii) SPS is shown to be inherently non-finitely based, (iii) SPS is shown to have no irredundant identity basis, and (iv) SPS is shown to have no covers and to be meet-prime in the lattice of all varieties of pseudosemilattices. Some applications to e-varieties of locally inverse semigroups are also derived.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.