In this study we give syntax, semantics and axiomatization for a family of modal logics with restricted form of universal modality. The language of these family of modal logics allows the expression of Boolean combinations of formulas of the form ∃φ where φ is a formula of the ordinary language of modal logic and ∃ is the universal diamond. By means of a tableaux-based approach, we provide decision procedures for their satisfiability problem.