`application/pdf`

.

##
###
Completely representable lattices

2012
*
Algebra Universalis
*

It is known that a lattice is representable as a ring of sets iff the lattice is distributive. CRL is the class of bounded distributive lattices (DLs) which have representations preserving arbitrary joins and meets. jCRL is the class of DLs which have representations preserving arbitrary joins, mCRL is the class of DLs which have representations preserving arbitrary meets, and biCRL is defined to be the intersection of jCRL and mCRL. We prove CRL is a strict subset of biCRL which is a strict

doi:10.1007/s00012-012-0181-4
fatcat:5f5mbqdannc3vej57ybmgt6a7m