1. Introduction. A meet semilattice is said to be weakly relatively pseudocomplemented, or just wr-pseudocomplemented, if, for every element x and every y ≤ x, all the maxima

Abstract. For any finite unital commutative idempotent semigroup S, a unital semilattice, we show how to compute the amenability constant of its semigroup algebra l(S), which is always of the form 4n+1. We then show that these give lower bounds to amenability constants of certain Banach algebras graded over semilattices. Our theory applies to certain natural subalgebras of Fourier-Stieltjes alg...

Today, the theoretical framework of mathematical morphology is phrased in terms of complete lattices and operators de ned on them. That means in particular that the choice of the underlying partial ordering is of eminent importance, as it determines the class of morphological operators that one ends up with. The duality principle for partially ordered sets, which says that the opposite of a par...

We prove that for any distributive ∨, 0-semilattice S, there are a meet-semilattice P with zero and a map µ : P × P → S such that µ(x, z) ≤ µ(x, y) ∨ µ(y, z) and x ≤ y implies that µ(x, y) = 0, for all x, y, z ∈ P , together with the following conditions: (i) µ(v, u) = 0 implies that u = v, for all u ≤ v in P. (ii) For all u ≤ v in P and all a, b ∈ S, if µ(v, u) = a ∨ b, then there are a positi...

We prove that for every distributive ∨, 0-semilattice S, there are a meet-semilattice P with zero and a map µ : P × P → S such that µ(x, z) ≤ µ(x, y) ∨ µ(y, z) and x ≤ y implies that µ(x, y) = 0, for all x, y, z ∈ P , together with the following conditions: (P1) µ(v, u) = 0 implies that u = v, for all u ≤ v in P. (P2) For all u ≤ v in P and all a, b ∈ S, if µ(v, u) ≤ a ∨ b, then there are a pos...