On order polynomially complete lattices (Q1802250)
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 203147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On order polynomially complete lattices |
scientific article; zbMATH DE number 203147 |
Statements
On order polynomially complete lattices (English)
0 references
29 March 1994
0 references
It is proven that every order polynomially complete lattice is bounded. Hence, a polynomially complete lattice cannot be countably infinite. This partially solves one of the most famous problems in the theory of polynomially complete lattices. However, the problem remains open for the uncountable case.
0 references
infinite lattice
0 references
order polynomially complete lattice
0 references
0.8523728251457214
0 references
0.8317591547966003
0 references
0.8153958320617676
0 references
0.7882428169250488
0 references
