On order polynomially complete lattices
type: Item
instance of: scholarly article
title: On order polynomially complete lattices
zbMATH Open document ID: 0784.06004
DOI: 10.1007/BF01196090
published in: Algebra Universalis
publication date: 1994-03-29T00:00:00Z
review text: 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.
reviewed by: Ivan Chajda
Mathematics Subject Classification ID: 06B05
Mathematics Subject Classification ID: 08A40
zbMATH DE Number: 203147
zbMATH Keywords: infinite lattice
zbMATH Keywords: order polynomially complete lattice
author: Hans K. Kaiser
author: Norbert Sauer
MaRDI profile type: Publication
cites work: A note on local polynomial functions over lattices
cites work: Über endliche, ordnungspolynomvollständige Verbände
cites work: Eine Charakterisierung endlicher, ordnungspolynomvollständiger Verbände
full work available at URL: https://doi.org/10.1007/bf01196090
OpenAlex ID: W2050314097
description: scientific article; zbMATH DE number 203147