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
Leonhardi S.D. [1997] Generalized nonsplitting in the recursively enumerable degrees J. Symbolic Logic, 62, № 2, 397-437 99.12.49 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Leonhardi S.D. [1996] . Nonbounding and Slaman triples Ann. Pure Appl. Logic, 79, № 2, 139-163 01.01.116 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.L La Roche P. Lachlan A. H. Lacombe D. Ladner R.E. LaForte G. Lakins T. Lambert W. M. Landweber L.H. Langford G. Läuchli H. Lavrov I.A. Lebeuf R. Leeds S. Leggett A. Leivant D. Lempp S. LeonardJ Leonhardi S.D. Lerman M. LewisA LewisFD LewisHR LewisPM LiAngs LiXiang Lipton R.J. Liu S.C. Loh Chang-wan LongTJ Longo G. Longpre L. Louveau A. Lowenthal F. Lu Hong Lubarsky R.S. Luckham D. Lynch N.A. Lyndon R.C. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.