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
Alton D.A. [1976] Diversity of speed-ups and embedding in computational complexity J. Symbolic Logic, 41, № 1, 199-214 77.01.44 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Alton D.A. [1975] A characterization of r -maximal sets Arch. Math. Logik Grundl., 17, № 1-2, 35-36 76.03.53 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Alton D.A. [1971] Recursively enumerable sets which are uniform for finite extensions J. Symbolic Logic, 36, № 2, 271-287 72.03.56 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Alton D.A. [1974] Iterated quotients of the lattice of recursively enumerable sets Proc. London Math. Soc., 28, № 1, 1-12 74.08.75 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Alton D.A. [1975] Embedding relations in the lattice of recursively enumerable sets Arch. Math. Logik Grundl., 17, № 1-2, 37-41 76.04.55 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.A AbianS Abraham U. Ackermann W. Aczel P. Addison J.W. Adleman L.M. Afshari B. Ahmad S. Alfeld Ch. Allender E. W. Aloisio P. Alton D.A. Ambos-Spies K. Appel K.I. AptKR Arbib M.A. Arslanov M. M, AshCJ AsserG. Ausiello G. AxJ Axt P. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.