On order-polynomial completeness of lattices (Q1966146)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On order-polynomial completeness of lattices |
scientific article; zbMATH DE number 1407099
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On order-polynomial completeness of lattices |
scientific article; zbMATH DE number 1407099 |
Statements
On order-polynomial completeness of lattices (English)
0 references
27 February 2000
0 references
In this note the authors prove that the cardinality of an infinite order polynomially complete lattice (if such a lattice exists) must be greater than every aleph (i.e., greater than each \(k_n\), where \(k_0\) is aleph zero and \(k_{n+1} = 2^{k_n}\) or \(n\geq 0\)).
0 references
order polynomially complete lattice
0 references
cardinality
0 references
