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
Wehner S. [1999] On recursive enumerability with finite repetitions J. Symbolic Logic, 64, № 3, 927-945 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Wehner S. [1998] Enumerations countable structures and Turing degrees Proc. Amer. Math. Soc., 126, № 7, 2131-2139 00.11.57 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Wehner S. [1995] On injective enumerabilits of recursively enumerable sets of cofinite sets Arch. Math. Logik Grundl., 34, № 3, 183-196 96.10.50 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.