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
Lerman M., Watnick R. [2003] Computable choice sets for computable linear ordering Math. Logic Quarterly, 49, № 5, 485-510 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Roy D. K. , Watnick R. [1988] Finite condensations of recursive linear orders Studia Logica, 47, № 4, 311-317 90.03.45 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Watnick R. [1984] A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings J. Symbolic Logic, 49, № 2, 563-569 85.01.62 G 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.