Doubling convex sets in lattices and a generalized semidistributivity condition

DOI10.1007/BF02034334zbMath0695.06005OpenAlexW2028101627MaRDI QIDQ909684

Alan Day, J. B. Nation, Steven T. Tschantz

Publication date: 1989

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02034334

zbMATH Keywords

semidistributive latticeinterval construction

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Varieties of lattices (06B20)

Related Items (10)

Addendum to ``Congruence normality of Alan Day ⋮ Cayley lattices of finite Coxeter groups are bounded ⋮ The generalized doubling construction and formal concept analysis ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ Obituary: R. Alan Day ⋮ Cover-preserving order embeddings into Boolean lattices ⋮ Infinite substructure lattices of models of Peano Arithmetic ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ The fundamental theorem of finite semidistributive lattices ⋮ Generalizing semidistributivity

Cites Work

• Lattice varieties covering the smallest non-modular variety
• Splitting lattices generate all lattices
• Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
• Finite Sublattices of a Free Lattice
• A Simple Solution to the Word Problem for Lattices

This page was built for publication: Doubling convex sets in lattices and a generalized semidistributivity condition