Completely representable lattices
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.
- 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
- Bounded distributive lattice expansions
- Complete representations in algebraic logic
- 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?)
- Model theory.
- Relation algebras by games
- Representations of Lattices by Sets
- On a representation of distributive lattices
- Compressed straight tableaux and a distributive lattice of representations
- A combinatorial representation for a special class of complete distributive lattices
- A representation theorem for CAC lattices
- Difference-restriction algebras of partial functions with operators: discrete duality and completion
- Difference-restriction algebras of partial functions: axiomatisations and representations
- Every finite lattice in \(\mathcal V(\mathbf M_ 3)\) is representable
- Representable posets
- ON COMPLEMENTEDLY NORMAL LATTICES II: EXTENSIONS
- Complete Lattices and Up-To Techniques
- scientific article; zbMATH DE number 1129496 (Why is no real title available?)
- scientific article; zbMATH DE number 2070403 (Why is no real title available?)
- Recursive axiomatisations from separation properties
- Non-elementary classes of representable posets
- A remark on complete lattices represented by sets
- Complete representation by partial functions for signatures containing antidomain restriction
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)