On order polynomially complete lattices

From MaRDI portal





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.











This page was built for publication: On order polynomially complete lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802250)