Completely Representable Lattices

Mathematics – Rings and Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This paper is to appear in Algebra Universalis

Scientific paper

10.1007/s00012-012-0181-4

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 subset of both jCRL and mCRL. Let L be a DL. Then L is in mCRL iff L has a distinguishing set of complete, prime filters. Similarly, L is in jCRL iff L has a distinguishing set of completely prime filters, and L is in CRL iff L has a distinguishing set of complete, completely prime filters. Each of the classes above is shown to be pseudo-elementary and hence closed under ultraproducts. The class CRL is not closed under elementary equivalence, hence it is not elementary.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Completely Representable Lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Completely Representable Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Completely Representable Lattices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-604403

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.