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
Giorgi M.B. [2004] The computably enumerable degrees are locally non-cappable Arch. Math. Logik Grundl., 43, № 1, 121-139 06.05.76 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Giorgi M.B., Sorbi A., Yang Yue [2006] Properly Σ 2 0 enumeration degrees and the high/low hierarchy J. Symbolic Logic, 71, № 4, 1125-1144 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.G GaleA GaleD Gandy R.O. Ganesan K. Gao Su Gasarch W.I. Georgieva N. Gerla G. Gill J. Giorgi M.B. Giusto M. Gladstone M.D. Glasser C. Gödel K. Goetze B. GoldEM Goldfarb W.D. Goncharov S.S. Gonshor H. Gordon C. E. Grant P.W. Grassin J. Greenberg N. Griffiths E.J. J. Griffor E.R. Grilliot T. Groszek M. J. Grzegorczyk A. Guichard D. Gurevich Ju. ...
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.