A Simple Solution to the Word Problem for Lattices
From MaRDI portal
Cited in
(33)- Lattices with a finite Whitman cover
- Almost distributive lattice varieties
- Constructions of \(S\)-lattices
- Obituary: R. Alan Day
- From a lattice to its ideal lattice
- An application of Whitman's condition to lattices with no infinite chains
- On a problem involving bounded epimorphisms of lattices
- Splitting lattices generate all lattices
- Lattices with finite \(W\)-covers
- Generalizing semidistributivity
- Congruence normality: The characterization of the doubling class of convex sets
- The generalized doubling construction and formal concept analysis
- Inflation of finite lattices along all-or-nothing sets
- Using congruence relations to extract knowledge from concept lattices
- Cayley lattices of finite Coxeter groups are bounded
- Alan Day's doubling construction
- Enumerating maximal consistent closed sets in closure systems
- Remarks about the Q-lattice of the variety of lattices
- Structure and enumeration results of matchable Lucas cubes
- Relative projectivity and transferability for partial lattices
- Relatively free products of lattices
- Infinite substructure lattices of models of Peano Arithmetic
- Covers in Free Lattices
- scientific article; zbMATH DE number 7551249 (Why is no real title available?)
- Primitive lattice varieties
- Factorizing lattices by interval relations
- Length-preserving extensions of a semimodular lattice by lowering a join-irreducible element
- Distributivity conditions and the order-skeleton of a lattice
- Decidability of lattice equations
- The canonical join complex
- Splitting p-algebras
- Horn sentences with (W) and weak Mal'cev conditions
- Doubling convex sets in lattices and a generalized semidistributivity condition
This page was built for publication: A Simple Solution to the Word Problem for Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5606613)
