Lattices freely generated by posets within a variety. Part I: Four easy varieties
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.