Belyaev V. m-reducibility with informational restrictions

New type of algorithmic reducibilities, which occurs by the restrictions R1, R0 on the volume of oracle access in m-reductions, is investigated in the dissertation. The lattice L of m-reducibilities with informational restrictions is investigated. The structure of recursively enumerable degrees for m-reducibilities with informational restrictions is studied. A criterion for the structure of unsolvability degrees to be an upper semi-lattice is obtained. The conditions of existence of complete sets are investigated. New characterization of cylinders in terms of m-reducibilities with informational restrictions is obtained.