Two embedding theorems for lower bounded lattices

DOI10.1007/BF01233912zbMath0901.06005MaRDI QIDQ1272234

K. V. Adaricheva

Publication date: 24 November 1998

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

zbMATH Keywords

finite latticelattice of subsemilatticeslower bounded lattice

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Semilattices (06A12) Free lattices, projective lattices, word problems (06B25)

Related Items

The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Sublattices of lattices of order-convex sets. I: The main representation theorem ⋮ On the representation of lattices by subsemigroup lattices of bands ⋮ Optimum basis of finite convex geometry ⋮ Unnamed Item ⋮ Lattices of regular closed subsets of closure spaces ⋮ Representing finite convex geometries by relatively convex sets ⋮ On the prevariety of perfect lattices ⋮ Open questions related to the problem of Birkhoff and Maltsev ⋮ Join-semidistributive lattices and convex geometries.

Cites Work

• On finite lattices which are embeddable in subsemigroup lattices
• Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
• Equational Bases and Nonmodular Lattice Varieties