pseudo-ordered set; trellis; $p$-chain; ascending well-ordered $p$-chain; cycle-complete trellis; complete trellis
This paper gives some new characterizations of completeness for trellises by introducing the notion of a cycle-complete trellis. One of our results yields, in particular, a characterization of completeness for trellises of finite length due to K. Gladstien (see K. Gladstien: Characterization of completeness for trellises of finite length, Algebra Universalis 3 (1973), 341–344).
 P. Crawley and R. P. Dilworth: Algebraic Theory of Lattices. Prentice Hall, Inc., Englewood Cliffs, 1973.
 E. Fried: Tournaments and non-associative lattices
. Ann. Univ. Sci. Budapest, Sect. Math. 13 (1970), 151–164. MR 0321837
 E. Fried and G. Gratzer: Some examples of weakly associative lattices
. Colloq. Math. 27 (1973), 215–221. MR 0327590
 S. Parameshwara Bhatta and H. Shashirekha: A characterization of completeness for trellises
. Algebra Universalis 44 (2000), 305–308. DOI 10.1007/s000120050189
| MR 1816026