We introduce the reduced signed logics which gen-eralize previous approaches to signed logics in the sense that each variable is allowed to have its own set of semantic values. Reductions on both signed logics and signed formulas are used to describe im-provements in tableau provers for MVLs. A labelled deductive system allows to use the implicit informa-tion in the formulas to describe improved expansion rules based on these reductions.