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
Jahn M.A. [1999] Implicit measurements of dynamic complexity properties and splitting of speedable sets J. Symbolic Logic, 64, № 3, 1037-1064 . 05.08.76 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jahn M.A. [1996] Σ 5 -completeness of index sets arising from the recursively enumerable Turing degrees Ann. Pure Appl. Logic, 79, № 2, 109-137 00.09.55 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jahn M.A. [1996] Σ 5 -completeness of index sets arising from the lattice of recursively enumerable sets Ann. Pure Appl. Logic, 80, № 1, 55-67 02.06.63 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.J Jacobs B. E. Jacobs K. Jahn M.A. Jain S. Janiczak A. Jaśkowski S. Jeffrey R.C. Jensen R. B. Jiang Zhingen Jockusch C. G. Jr. Johnson N. JonesJP Joseph D. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.