We prove that an infinite (bounded) involution lattice and even pseudo-Kleene algebra can have any number of congruences between 2 and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals as elements or as many ideals as subsets. Furthermore, when they have at most as many congruences as elements, these involution lattices and even pseudo-Kleene algebras can be chosen such that all their lattice congruences preserve their involutions, so that they have as many congruences as their lattice reducts. Under the Generalized Continuum Hypothesis, this means that an infinite (bounded) involution lattice and even pseudo-Kleene algebra can have any number of congruences between 2 and its number of su...
summary:We introduce the concept of a pseudo-Kleene algebra which is a non-distributive modification...
We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices ...
International audienceFor a finite lattice L, let EL denote the reflexive and transitive closure of ...
Let λ and κ be cardinal numbers such that κ is infinite and either2 ≤ λ ≤ κ, or λ = 2κ. We prove th...
J. Tuma proved an interesting "congruence amalgamation" result. We are generalizing and providing an...
AbstractLet L be a bounded lattice, let [a,b] and [c,d] be intervals of L, and let ϕ:[a,b]→[c,d] be ...
An important and long-standing open problem in universal algebra asks whether every finite lattice i...
(Bounded integral) residuated lattices (which need not be commutative) form a large class of algebra...
Dedicated to Garrett Birkhoff on the occasion of his eightieth birthday Nearly twenty years ago, two...
AbstractWe characterise, via the poset of their join-irreducible elements, the distributive lattices...
A bounded integral residuated lattice ( = residuated lattice, for short) is an algebra M = (M; ,∨,∧,...
International audienceThe Congruence Lattice Problem asks whether every algebraic distributive latti...
Let Q be a subset of a finite distributive lattice D. An algebra A represents the inclusion Q ⊆ D by...
Abstract: We give a necessary and su ¢ cient condition for a bounded involution lattice to be isomor...
1 * Introduction, The structure of a lattice L, in particular its rep-resentation as direct or subdi...
summary:We introduce the concept of a pseudo-Kleene algebra which is a non-distributive modification...
We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices ...
International audienceFor a finite lattice L, let EL denote the reflexive and transitive closure of ...
Let λ and κ be cardinal numbers such that κ is infinite and either2 ≤ λ ≤ κ, or λ = 2κ. We prove th...
J. Tuma proved an interesting "congruence amalgamation" result. We are generalizing and providing an...
AbstractLet L be a bounded lattice, let [a,b] and [c,d] be intervals of L, and let ϕ:[a,b]→[c,d] be ...
An important and long-standing open problem in universal algebra asks whether every finite lattice i...
(Bounded integral) residuated lattices (which need not be commutative) form a large class of algebra...
Dedicated to Garrett Birkhoff on the occasion of his eightieth birthday Nearly twenty years ago, two...
AbstractWe characterise, via the poset of their join-irreducible elements, the distributive lattices...
A bounded integral residuated lattice ( = residuated lattice, for short) is an algebra M = (M; ,∨,∧,...
International audienceThe Congruence Lattice Problem asks whether every algebraic distributive latti...
Let Q be a subset of a finite distributive lattice D. An algebra A represents the inclusion Q ⊆ D by...
Abstract: We give a necessary and su ¢ cient condition for a bounded involution lattice to be isomor...
1 * Introduction, The structure of a lattice L, in particular its rep-resentation as direct or subdi...
summary:We introduce the concept of a pseudo-Kleene algebra which is a non-distributive modification...
We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices ...
International audienceFor a finite lattice L, let EL denote the reflexive and transitive closure of ...