GREEN-SCHWARZ SUPERSTRING IN EXTENDED CONFIGURATION-SPACE AND THE INFINITELY REDUCIBLE FIRST CLASS CONSTRAINTS PROBLEM

The Green-Schwarz superstring action is modified to include some set o f additional (on-shell trivial) variables. A complete constraint syste m of the theory turns out to be reducible both in the original and in additional variable sectors. The initial 8s first class constraints an d 8c second class ones are shown to be unified with sc first class and 8s second class constraints from the additional variables sector, res ulting in SO(1,9)-covariant and linearly independent constraint sets. Residual reducibility proves to fall on second class constraints only.