The semilattice relevant logics R-boolean OR, T-boolean OR, (RW)-R-boolean OR, and (TW)-T-boolean OR (slightly different from the orthodox relevant logics R, T, RW, and TW) are defined by semilattice models in which conjunction and disjunction are interpreted in a natural way. For each of them, there is a cut-free labelled sequent calculus with plural succedents (like LK). We prove that these systems are equivalent, with respect to provable formulas, to the restricted systems with single succedents (like LJ). Moreover, using this equivalence, we give a new Hilbert-style axiomatizations for R-boolean OR and T-boolean OR and prove equivalence between two semantics (commutative monoid and distributive semilattice) for the contractionless logics (RW)-R-boolean OR and (TW)-T-boolean OR.