A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications

Cut-free sequent calculi for the predicate intermediate logic CD of constant domains have appeared only very recently in literature, even if this logic has been axiomatized since the early seventies. In the present paper we propose a different cut-free sequent calculus for CD, in which a great care is devoted in avoiding duplications of formulas.