Order polynomially complete lattices must be large (Q1966144)

A lattice \(L\) is order polynomially complete if every monotone function on \(L\) is a polynomial function. The question whether there exists an infinite order polynomially complete lattice has been treated by H. Kaiser and N. Sauer. Recently M. Haviar and M. Ploščica showed that such a lattice would have to be at least of size \(k_{\omega }\), where \(k_0 = \aleph _0\), \(k_{n+1} = 2^{k_n}\) and \(k_{\omega } = \sup \{k_n; n\in \omega \}\). The authors show here that the size of a lattice in question (if one exists at all) must be a strongly inaccessible cardinal.