Completely representable lattices

DOI10.1007/S00012-012-0181-4zbMATH Open1259.06008arXiv1201.2331OpenAlexW3102176924MaRDI QIDQ422347FDOQ422347

Robert Egrot, Robin Hirsch

Publication date: 16 May 2012

Published in: Algebra Universalis (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1201.2331

zbMATH Keywords

bounded distributive latticesBoolean algebrascomplete representationprime filters

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05) Structure and representation theory of distributive lattices (06D05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Model theory.
• Bounded distributive lattice expansions
• Relation algebras by games
• Complete representations in algebraic logic
• Representations of Lattices by Sets

Cited In (13)

• Compressed straight tableaux and a distributive lattice of representations
• Title not available (Why is that?)
• Difference-restriction algebras of partial functions with operators: discrete duality and completion
• Difference-restriction algebras of partial functions: axiomatisations and representations
• A representation theorem for CAC lattices
• Representable posets
• RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES
• Non-elementary classes of representable posets
• Every finite lattice in \(\mathcal V(\mathbf M_ 3)\) is representable
• Complete Lattices and Up-To Techniques
• Complete representation by partial functions for signatures containing antidomain restriction
• ON COMPLEMENTEDLY NORMAL LATTICES II: EXTENSIONS
• Title not available (Why is that?)

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)