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
Omanadze R.Sh.,Sorbi A. [2006] Strong enumeration reducibilities Arch. Math. Logik Grundl., 45, 7, 869-912 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Omanadze R. Sh. [2009] Nonbounding n-c.e. Q-degree Georgian Math. Jour., 16, № 4, 779-786 11.01.73 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Omanadze R.Sh.,Sorbi A. [2008] A characterization of the Δ 2 0 hyperhyperimmune sets J. Symbolic Logic, 73, 4, 1407-1415 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Omanadze R. Sh. [2002] On some properties of r -maximal sets and Q 1- N reducibility Georgian Math. J., 9, № 1, 161-166 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Omanadze R.Sh.,Sorbi A. [2010] Immunity properties of the s -degrees Georgian Math. Jour., 17, № 3, 563-579 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Arslanov M.M., Omanadze R.Sh. [2007] Q -degrees of n -c.e. sets Ill. J. Math., 51, № 4, 1189-1206 10.02.136 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Arslanov M.M., Batyrshin I.I., Omanadze R.Sh. [2008] Structural properties of n -c.e Q -degrees Ann. Pure Appl. Logic, 156, № 1,13-20 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Omanadze R. Sh. [2004] Splittings of effectively speedable sets and effectively levelable sets. J. Symbolic Logic, 69, № 1, 143-158 06.02.26 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Omanadze R. Sh. [2003] Quasi-degrees of recursively enumerable sets Computability and models: perspectives East and West, Kluwer Academic/Plenum Publishers, 289-319 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Omanadze R. Sh. [1987] Relation between recursively enumerable Q - and T -degrees Proc. VIII Inter. Congress Logic, Methodology, Philosophy Sci., (Moscow, 1987), Moscow, 157-158 88.02.35 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.O Oberschelp A. Odifreddi P.G. Odintsov S. P. Ogiwara M. Ohashi K. Omanadze R. Sh. Orlicki A. Ouspenski V.A. Owings J.C. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.