Lattices freely generated by posets within a variety. Part I: Four easy varieties
From MaRDI portal
Publication:6502679
arXiv1004.4082MaRDI QIDQ6502679FDOQ6502679
Marcel Wild, Jean Yves Semegni
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 page was built for publication: Lattices freely generated by posets within a variety. Part I: Four easy varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6502679)
