Abstract: 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.
Recommendations
- Complete congruence lattices of complete distributive lattices
- Complete congruence lattices of join-infinite distributive lattices
- The complete distributivity of ideal lattices
- A combinatorial representation for a special class of complete distributive lattices
- "Complete-Simple" Distributive Lattices
Cites work
- scientific article; zbMATH DE number 5367214 (Why is no real title available?)
- scientific article; zbMATH DE number 3777562 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 3304085 (Why is no real title available?)
- Bounded distributive lattice expansions
- Complete representations in algebraic logic
- Model theory.
- Relation algebras by games
- Representations of Lattices by Sets
Cited in
(16)- Recursive axiomatisations from separation properties
- scientific article; zbMATH DE number 1129496 (Why is no real title available?)
- A combinatorial representation for a special class of complete distributive lattices
- ON COMPLEMENTEDLY NORMAL LATTICES II: EXTENSIONS
- A representation theorem for CAC lattices
- Difference-restriction algebras of partial functions with operators: discrete duality and completion
- On a representation of distributive lattices
- Every finite lattice in \(\mathcal V(\mathbf M_ 3)\) is representable
- Complete Lattices and Up-To Techniques
- Difference-restriction algebras of partial functions: axiomatisations and representations
- Representable posets
- Complete representation by partial functions for signatures containing antidomain restriction
- Non-elementary classes of representable posets
- A remark on complete lattices represented by sets
- scientific article; zbMATH DE number 2070403 (Why is no real title available?)
- Compressed straight tableaux and a distributive lattice of representations
This page was built for publication: Completely representable lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q422347)
