For first-order classical logic a new notion of admissible substitution is defined. This notion allows
optimizing the procedure of the application of quantifier rules when logical inference search is made in
sequent calculi. Our objective is to show that such a computer-oriented sequent technique may be created
that does not require a preliminary skolemization of initial formulas and that is efficiently comparable with
methods exploiting the skolemization. Some results on its soundness and completeness are given.