“…It is well known that there are problems to connect reduction steps of the cut-elimination procedure from a system of sequents and reduction steps of the normalization procedure from a natural deduction system when these systems cover full intuitionistic predicate logic (see, for example, the part 7 in [15]). To solve these problems the authors connected some modifications of Gentzen's systems LJ and NJ (see [2,8,9,10,15]), or they defined new reduction steps in cut-elimination and normalization procedures (see [2,4,10,15]). In some papers mentioned above (see, for example, [10,15]) it was concluded that "the cut-elimination theorem and the normalization theorem are equivalent".…”