A characterization of completeness for trellises
A trellis is defined as a pseudo-ordered set any two of whose elements have a GLB and LUB (a pseudo-order is a reflexive and antisymmetric binary relation). Main result: A trellis \(A\) is complete (i.e. every subset of \(A\) has a GLB and a LUB) if and only if every ascending well-ordered \(p\)-chain in \(A\) has a join.
scientific article; zbMATH DE number 1899969