Free trees and the optimal bound in Wehrung's theorem

2008/01/01 by Pavel Růžička · 21 citations
Computer Science · Decision Sciences · Mathematics · #Advanced Algebra and Logic #Fuzzy and Soft Set Theory #Rings, Modules, and Algebras #Mathematics #Distributive property #Homomorphism #Semilattice #Aleph #Combinatorics #Range (aeronautics) #Discrete mathematics #Pure mathematics #Theology

paper · pdf · doi:10.4064/fm198-3-2

published in Fundamenta Mathematicae 198(3), 217-228 (Polish Academy of Sciences)

openalex publication_date 2008/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31

Abstract

We prove that there is a distributive (\vee,0,1)-semilattice G of size ℵ₂ such that there is no weakly distributive (\vee,0)-homomorphism from \mathop\rm Con_c A to G with 1 in its range, for any algebra A wit

Citations

• Sur une caractérisation des alephs
• Congruence lattices of free lattices in non-distributive varieties
• A uniform refinement property for congruence lattices
• Distributive congruence lattices of congruence-permutable algebras
• SIMULTANEOUS REPRESENTATIONS OF SEMILATTICES BY LATTICES WITH PERMUTABLE CONGRUENCES
• A solution to Dilworth's congruence lattice problem
• On the distributivity of a lattice of lattice-congruences
• A survey of recent results on congruence lattices of lattices
• Non-measurability properties of interpolation vector spaces
• On congruence lattices of lattices

Cited by

• Congruence lattice problem [wikipedia]