A technical lemma for congruences of finite lattices
From MaRDI portal
Publication:2510715
DOI10.1007/s00012-014-0285-0zbMath1436.06012arXiv1308.4607OpenAlexW1974924798WikidataQ124838958 ScholiaQ124838958MaRDI QIDQ2510715
Publication date: 1 August 2014
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.4607
Related Items (11)
The ordered set of principal congruences of a countable lattice. ⋮ Congruences of fork extensions of slim, planar, semimodular lattices ⋮ Congruence structure of planar semimodular lattices: the general swing lemma ⋮ A note on finite lattices with many congruences ⋮ Representing an isotone map between two bounded ordered sets by principal lattice congruences ⋮ Complete congruence lattices of two related modular lattices ⋮ Unnamed Item ⋮ Congruences in slim, planar, semimodular lattices: The Swing Lemma ⋮ Patch extensions and trajectory colorings of slim rectangular lattices. ⋮ Representing some families of monotone maps by principal lattice congruences ⋮ Cometic functors and representing order-preserving maps by principal lattice congruences
Cites Work
- Congruences of fork extensions of slim, planar, semimodular lattices
- The order of principal congruences of a bounded lattice
- Patch extensions and trajectory colorings of slim rectangular lattices.
- A note on congruence lattices of slim semimodular lattices.
- Lattice Theory: Foundation
- Ideals and congruence relations in lattices
- Lattice Theory: Special Topics and Applications
- Unnamed Item
- Unnamed Item
This page was built for publication: A technical lemma for congruences of finite lattices