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
Welch P. D. [2003] On revision operators J. Symbolic Logic, 68, № 2, 689-711 04.09.116 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Welch P. D. [1985] Comparing incomparable Kleene degrees J. Symbolic Logic, 50, № 1, 55-58 86.03.18 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Welch P. D. [1987] Minimality in the Δ 3 1 -degrees J. Symbolic Logic, 52, № 4, 908-915 88.07.48 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Welch P. D. [1986] The natural hierarchy and quasi-hierachy of constructability degrees J. Symbolic Logic, 51, № 1, 130-134 86.11.23 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Welch P. D. [2000] Eventually infinite time turing machine degrees: Infinite time decidable reals J. Symbolic Logic, 65, № 3, 1193–1203 07.01.76 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.