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
Bojkova E. [1999] An a example of a finite number of recursively enumerable m -degrees containing an infinite sequence of recursively enumerable sets Ann.Univ. Sofia Fac. Math., Inform., 1993 (1999), 87, 223-234 05.08.82 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.... Baurle F.A. Batyrshin I.I. Becker H. Behman H. Beigel R.J. Belyaev V. N. Bennison V.L. Bentzien L. Bereznyuk S. Bergstra J. A. BermanL BermanP Bernardi C. Bernays P. Berry J. Bianchini C. Bickford M. Binns S. Blacino L. Blair H. A. Blaylock R. Blum M. Bojkova E. BookR Boolos G. Boon W.W. Börger E. Borodin A. Boyd R. Brandt U. Breidbart S. BrownAB BrownDK Buchberger B. Büchi J.R. Bulitko V.K. Burkard E. Burris S. Buss S. Byerly R. E. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.