The ordered set of principal congruences of a countable lattice.
From MaRDI portal
Publication:292837
DOI10.1007/s00012-016-0376-1zbMath1343.06003arXiv1305.0965OpenAlexW2244616976MaRDI QIDQ292837
Publication date: 9 June 2016
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.0965
Partial orders, general (06A06) Representation theory of lattices (06B15) Lattice ideals, congruence relations (06B10)
Related Items (10)
Characterizing fully principal congruence representable distributive lattices ⋮ Some preliminary results on the set of principal congruences of a finite lattice ⋮ Representing an isotone map between two bounded ordered sets by principal lattice congruences ⋮ Homomorphisms and principal congruences of bounded lattices. II. Sketching the proof for sublattices ⋮ Homomorphisms and principal congruences of bounded lattices. III. The independence theorem ⋮ On the set of principal congruences in a distributive congruence lattice of an algebra ⋮ Representing some families of monotone maps by principal lattice congruences ⋮ Cometic functors and representing order-preserving maps by principal lattice congruences ⋮ Representing a monotone map by principal lattice congruences ⋮ On the largest numbers of congruences of finite lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The order of principal congruences of a bounded lattice
- Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices
- \((1+1+2)\)-generated equivalence lattices
- A solution to Dilworth's congruence lattice problem
- A technical lemma for congruences of finite lattices
- The structure of relatively complemented lattices
- Planar Semimodular Lattices: Congruences
- Lattice Theory: Foundation
- Congruence Lattices of Finite Semimodular Lattices
- Free trees and the optimal bound in Wehrung's theorem
This page was built for publication: The ordered set of principal congruences of a countable lattice.