A Simple Solution to the Word Problem for Lattices

From MaRDI portal
Publication:5606613

DOI10.4153/CMB-1970-051-0zbMath0206.29702OpenAlexW2065619734MaRDI QIDQ5606613

Alan Day

Publication date: 1970

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-1970-051-0




Related Items

Congruence normality: The characterization of the doubling class of convex setsAlmost distributive lattice varietiesCayley lattices of finite Coxeter groups are boundedThe generalized doubling construction and formal concept analysisAlan Day's doubling constructionRelative projectivity and transferability for partial latticesInflation of finite lattices along all-or-nothing setsFactorizing lattices by interval relationsLength-preserving extensions of a semimodular lattice by lowering a join-irreducible elementDoubling convex sets in lattices and a generalized semidistributivity conditionCovers in Free LatticesDistributivity conditions and the order-skeleton of a latticeConstructions of \(S\)-latticesRemarks about the Q-lattice of the variety of latticesThe canonical join complexObituary: R. Alan DayFrom a lattice to its ideal latticeUnnamed ItemAn application of Whitman's condition to lattices with no infinite chainsOn a problem involving bounded epimorphisms of latticesSplitting lattices generate all latticesInfinite substructure lattices of models of Peano ArithmeticUsing congruence relations to extract knowledge from concept latticesStructure and enumeration results of matchable Lucas cubesLattices with finite \(W\)-coversRelatively free products of latticesLattices with a finite Whitman coverSplitting p-algebrasHorn sentences with (W) and weak Mal'cev conditionsGeneralizing semidistributivityPrimitive lattice varietiesEnumerating maximal consistent closed sets in closure systems