Representing congruence lattices of lattices with partial unary operations as congruence lattices of lattices. I: Interval equivalence.

DOI10.1016/S0021-8693(03)00501-5zbMath1098.06003OpenAlexW2097908459MaRDI QIDQ1414031

E. Tamás Schmidt, George Grätzer

Publication date: 19 November 2003

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

Full work available at URL: https://doi.org/10.1016/s0021-8693(03)00501-5

zbMATH Keywords

Boolean triple constructionCongruence latticeCongruence-preserving extensionLattice tensor product

Mathematics Subject Classification ID

Lattice ideals, congruence relations (06B10)

Related Items (2)

My collaboration with E. T. Schmidt spanning six decades ⋮ Representing congruence lattices of lattices with partial unary operations as congruence lattices of lattices. II: Interval ordering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice tensor products. IV.
• Every finite distributive lattice is the congruence lattice of some modular lattice
• Regular congruence-preserving extensions of lattices.
• A survey of recent results on congruence lattices of lattices.
• Representing congruence lattices of lattices with partial unary operations as congruence lattices of lattices. II: Interval ordering
• Forcing extensions of partial lattices
• A new lattice construction: The box product
• Proper congruence-preserving extensions of lattices
• Ideals and congruence relations in lattices
• A uniform refinement property for congruence lattices
• Congruence lattices of free lattices in non-distributive varieties
• SIMULTANEOUS REPRESENTATIONS OF SEMILATTICES BY LATTICES WITH PERMUTABLE CONGRUENCES

This page was built for publication: Representing congruence lattices of lattices with partial unary operations as congruence lattices of lattices. I: Interval equivalence.