A characterization of completeness for trellises (Q1866849): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s000120050189 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993332859 / rank | |||
Normal rank | |||
Latest revision as of 02:20, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of completeness for trellises |
scientific article |
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
