Covers in Free Lattices
From MaRDI portal
Publication:3682531
DOI10.2307/2000423zbMath0567.06008OpenAlexW4232412474MaRDI QIDQ3682531
Publication date: 1985
Full work available at URL: https://doi.org/10.2307/2000423
algorithmfinite intervalsweakly atomiccovering chainsfinitely generated free latticetotally atomic elements
Related Items
Congruence normality: The characterization of the doubling class of convex sets ⋮ Directions in lattice theory ⋮ Jónsson's contributions to lattice theory ⋮ Singular covers in free lattices ⋮ An approach to lattice varieties of finite height ⋮ Symmetric embeddings of free lattices into each other ⋮ Lattice varieties covering \(V(L_ 1)\) ⋮ Free lattice algorithms ⋮ Finitely Presented Lattices: Canonical Forms and the Covering Relation ⋮ Abstract reflexive sublattices and completely distributive collapsibility ⋮ Primitive lattice varieties
Cites Work
- A note on finite sublattices of free lattices
- Ideal lattices of lattices
- Splitting lattices generate all lattices
- Projective lattices
- Free lattices
- Free lattices. II
- Coverings in free lattices
- Finite Sublattices of a Free Lattice
- Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
- Finite Sublattices of a Free Lattice
- Sublattices of a Free Lattice
- A Simple Solution to the Word Problem for Lattices
- Equational Bases and Nonmodular Lattice Varieties
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item