Completely representable lattices (Q422347)

The aim of the paper under review is to investigate the possibility of a complete representation for the class of bounded distributive lattices. This problem is more complex than the case of Boolean algebras, since in the absence of Boolean complementation, a representation of a distributive lattice may be complete with respect to one of the lattice operations but not with respect to the other. It is proved that the class \textbf{CRL} of completely representable bounded distributive lattices is not elementary. However, the authors show that it is possible to characterize the complete representability of a lattice in terms of the existence of certain prime filters. Using this characterization, an alternative proof of the identification of the completely representable Boolean algebras with the atomic ones is provided. It is also shown that \textbf{CRL} and the class of bounded distributive lattices that have representations respecting either or both arbitrary infima and suprema are pseudo-elementary, and thus closed under ultraproducts. I think the article contains valuable results and may be a starting point for other studies on this subject.