Lattices freely generated by posets within a variety. Part I: Four easy varieties
classification
🧮 math.CO
keywords
algorithmeasyfourfreelygeneratedlatticesvarietiesclosure
read the original abstract
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated by partially ordered sets within four easy varieties.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.