Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Finite orders and their minimal strict completion lattices

Gabriela Hauser BordaloBernard Monjardet — 2003

Discussiones Mathematicae - General Algebra and Applications

Whereas the Dedekind-MacNeille completion D(P) of a poset P is the minimal lattice L such that every element of L is a join of elements of P, the minimal strict completion D(P)∗ is the minimal lattice L such that the poset of join-irreducible elements of L is isomorphic to P. (These two completions are the same if every element of P is join-irreducible). In this paper we study lattices which are minimal strict completions of finite orders. Such lattices are in one-to-one correspondence with finite...

Page 1

Download Results (CSV)