Parameshwara Bhatta, S.; Shashirekha, H. A characterization of completeness for trellises. (English) Zbl 1013.06003 Algebra Univers. 44, No. 3-4, 305-308 (2000). 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. Reviewer: Ivan Chajda (Olomouc) Cited in 3 Documents MSC: 06A06 Partial orders, general 06B23 Complete lattices, completions Keywords:pseudo-order; trellis; complete trellis PDF BibTeX XML Cite \textit{S. Parameshwara Bhatta} and \textit{H. Shashirekha}, Algebra Univers. 44, No. 3--4, 305--308 (2000; Zbl 1013.06003) Full Text: DOI OpenURL