Search results

Yang Dong Ping [1997] Bounding minimal degrees by computably enumerable degrees J. Symbolic Logic, 63, № 4, 1319-1347 ? article Вернуться к поиску

Yang Dong Ping [1987] The existence of minimal honest polynomial degrees below Chin. Quart. J. Math., 2, 21-26 ? O article Вернуться к поиску

Li A., Yang Dong Ping [1998] Bounding minimal degrees by computably enumerable degrees J. Symbolic Logic, 63, № 4, 1319-1347 02.09.54 O article Вернуться к поиску

Ambos-Spies K., Homer S., Yang Dong Ping [1990] Honest polynomial reductions and exptalli sets Lect. Notes in Math.,1432, 1-22, Springer-Verlag ? O article Вернуться к поиску

Ambos-Spies K., Yang Dong Ping [1995] Some methods used in the research of structural polynomial complexity Adv. Math., (China), 24, 289-298 ? article Вернуться к поиску

Yang Dong Ping [1984] On the embedding of α-recursive presentable lattices into the α-recursive degrees below 0 / J. Symbolic Logic, 49, № 2, 488-502 85.01.49 article Вернуться к поиску

Ambos-Spies K., Yang Dong Ping [1990] Honest polynomial time degrees of elementary recursive sets Lect. Notes in Comp. Sci, 440, 1-15, Springer-Verlag 92.Г7.101 O article Вернуться к поиску

Y YaknisA YaknisV Yang Dong Ping Yang Yue Yasuhara A. Yates C.E.M. Yi Xiaoding Young P.R. YuLiang Yue Jang Yuefei Sui Вернуться на главную страницу