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
Lubarsky R.S. [1993] μ-definable sets of integers J. Symbolic Logic, 58, № 1, 291-313 94.08.115 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lubarsky R.S. [1987] Simple r.e. degree structure J. Symbolic Logic, 52, № 1, 208-213; corr. 53, № 1, 103-104 87.11.56 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lubarsky R.S. [1987] Uncoutable master codes and the jump hierachiy J. Symbolic Logic, 52, № 4, 952-958 88.06.66 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lubarsky R.S. [1988] Definability and initial segments of c -degrees J. Symbolic Logic, 53, № 4, 1070-1081 89.12.65 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lubarsky R.S. [1989] Sacks-forcing sometimes needs help to produce a minimal upper bound J. Symbolic Logic, 54, № 2, 490-498 90.06.44 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A..... 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.