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
Byerly R.E. [1982] Recursion theory and the lambda-calculus J. Symbolic Logic, 47, № 1, 67-83 82.08.56 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Byerly R. E. [1984] Some properties of invariant sets J. Symbolic Logic, 49, № 1, 9-21 85.01.57 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Byerly R. E. [1982] An invariance notion in recursion theory J. Symbolic Logic, 47, № 1, 48-66 82.08.52 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Byerly R.E. [1983] Definability of r. e. sets in a class of recursion theoretic structures J. Symbolic Logic, 48, № 3, 662-669 84.06.32 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Byerly R. E. [1984] Definability of recursively enumerable sets in abstract computational complexity Z. math. Logik und Grundl. Math., 30, № 6, 499-503 85.08.51 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.... 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.