Completely representable lattices

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...

Full description

Saved in:
Bibliographic Details
Published in:Algebra universalis 2012-05, Vol.67 (3), p.205-217
Main Authors: Egrot, Robert, Hirsch, Robin
Format: Article
Language:English
Subjects:
Algebra
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 . We prove where the marked inclusions are proper. Let L be a DL. Then iff L has a distinguishing set of complete, prime filters. Similarly, iff L has a distinguishing set of completely prime filters, and iff L has a distinguishing set of complete, completely prime filters. Each of the classes above is shown to be pseudo-elementary , hence closed under ultraproducts. The class CRL is not closed under elementary equivalence, hence it is not elementary.
ISSN:0002-5240
1420-8911
DOI:10.1007/s00012-012-0181-4