Lattices freely generated by posets within a variety. Part I: Four easy varieties
Jean Yves Semegni, Marcel Wild · arXiv (Cornell University) · 2010
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.