Search results
News
General Theory of Computability
(bibliography)
by Lavrov I.A.
By Author Name:
English: A-B-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-Z
Русские: А-Б-В-Г-Д-Е-Ж-З-И-К-Л-М-Н-О-П-Р-С-Т-У-Ф-Х-Ц-Ч-Ш-Щ-Э-Ю-Я
Search
Wald K. [2002] On orbits of prompt and low computably enumerable sets J. Symbolic Logic, 67, № 2, 649-678 05.09.89 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Burkard E., Lerman M., Wald K. [2003] Homomorphisms and quotients of degree structure Ann. Pure Appl. Logic, 123, № 1-3, 193-233 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Englert B., Lerman M., Wald K. [2003] Homomorphisms and quotients of degree structures Ann. Pure Appl. Logic, 123, № 1-3, 193-233 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.W WagnerEG WagnerK Wagner.KW Wainer S.S. Wald K. Walk S. WangHao WangJ Watanabe O. Watnick R. Watson P. WeberF Weber.FP WeberR Wechsung G. Wehner S. Weihrauch K. Weitkamp G. WelchL Welch.LV WelchPD Weyuker E. White W. Wiehagen R. Winklmann K. Woodin H.W. Woods A.R. Wrathall C. Wright J. B. Wu G. ...
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.