A characterization of completeness for trellises (Q1866849)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1899969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of completeness for trellises |
scientific article; zbMATH DE number 1899969 |
Statements
A characterization of completeness for trellises (English)
0 references
23 April 2003
0 references
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.
0 references
pseudo-order
0 references
trellis
0 references
complete trellis
0 references
0.8121190667152405
0 references
0.7699148058891296
0 references
0.7368976473808289
0 references
