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
Yates C.E.M. [1970] Initial segments of the degrees of unsolvability, part II: Minimal degrees J. Symbolic Logic, 35, № 2, 243-266 71.06.60 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Fejer L., Shore R.A. [1990] A direct construction of a minimal recursively enumerable truth-table degree Lect. Notes in Math., 1432, 187-204, Springer-Verlag ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kummer M. [1990] Recursive numerations without repetition revisited Lect. Notes in Math., 1432, 255-275, Springer-Verlag ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Odifreddi P.G. [1981] Strong reducibilities Bull. Amer. Math. Soc., 4, № 1, 37-86 81.11.54 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedman Sy D. [1994] The genericity conjecture J. Symbolic Logic, 59, № 2, 606-614 95.08.69 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Канович М.И. [1982] О табличных сводимостях проблем продолжения частично-рекурсивных функций ДАН СССР, 264, № 2, 294-298 82.10.43 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Feferman S. [1965] Some applications of the notions of forcing and generic sets Fund. Math., 56, № 3, 325-345 66.03.77 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Денисов С.Д. [1978] Строение верхней полурешетки рекурсивно перечислимых m -степеней и смежные вопросы, I Алгебра и логика, 17, № 6, 643-683 79.10.43 OS статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Shore R. A. [2006] Invariants, Boolean algebras and ACA 0 + Trans. Amer. Math. Soc., 358, № 3, 989-1014 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ladner R.E., Sasso L.P. [1975] The weak truth table degrees of recursively enumerable sets Ann. Math. Logic, 8, № 4, 429-448 76.02.87 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hrbacek K., Simpson S.G. [1980] On Kleene degrees of analytic sets Proc. “The Kleene Symposium”, (Madison, Wisconsin , USA, 1979), North-Holland, 269-274 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Nerode A., Remmel J.B. [1985] Generic objects in recursion theory Lect. Notes in Math., 1141, 271-314, Springer-Verlag 86.04.48 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Кобзев Г.Н. [1980] wtt -степени без максимальных tt -степеней Сооб. АН ГССР, 122, № 2, 249-252 86.11.40 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jensen R. B., Karp C. [1971] Primitive recursive set functions Logic Coll’69, North Holland, 143-137 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Rabin M. [1965] A simple method for undecidability proofs and some applications Proc. II Inter. Congress Logic, Methodology, Philosophy Sci., (Amsterdam, 1965), Amsterdam, 1965, 58-68 69.06.97 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Degtev A.N. [1982] Small degrees in ordinary recursive theory Proc. VI Inter. Congress Logic, Methodology, Philosophy Sci., (Hannover, 1979), North-Holland, 237-240 ? S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Арсланов M.M. [1979] Слабо рекурсивно перечислимые степени и предельная вычислимость Вероят. методы и кибернетика, Казань, Из-во КГУ, № 15, 3-9 79.12.40 OS статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Dekker J.C.E., Myhill J. [1958] Some theorems on classes of recursively enumerable sets Trans. Amer. Math. Soc., 89 , № 1, 25-59 60.2667 REOS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Гуревич Ю.Ш. [1966] К проблеме разрешения для чистого узкого исчисления предикатов ДАН СССР, 166, № 5, 1032-1034 66.08.77 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Breidbart S. [1978] On splitting recursive sets J. Comp. and Syst. Sci., 17, № 1, 56-64 79.B4.505 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Поляков Е.А., Розинас М.Г. [1978] Частичные степени иммунных и гипериммунных множеств Сибирск. матем. журнал, 19, № 4, 866-870 78.12.67 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Slaman T.A. [1985] The E - recursively enumerable degrees are dense Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 195-213 86.03.44 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hemachandra L.A. [1988] Structure of complexity classes: separations, collapses and completeness Lect. Notes in Comp. Sci.,324, 59-73, Springer-Verlag ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Добрица В.П. [1987] Об ограниченной предельной сводимости вычислимых индексаций классов конструктивных моделей, Вычис. системы, 120, 143-158, Новосибирск 88.ВН8.52 G статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ambos-Spies K., Fejer P.A. [2001] Embedding of N 5 and the contiguous degrees. Ann. Pure Appl. Logic, 112, № 2-3, 151-188 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Трахтенброт Б.А. [1967] Сложность алгоритмов и вычислений Новосибирск, Из-во НГУ ? O книга Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Оманадзе Р.Ш. [1978] О сводимостях на классе рекурсивно перечислимых множеств Сооб. АН ГССР, 91, № 3, 549-552 79.04.84 OS статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hodes H. T. [1981] Upper bounds on locally countable admissible initial segments of a Turing degrees hierarchy J. Symbolic Logic, 46, № 4, 753-760 82.08.48 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Young P.R. [1985] Gödel theorems, exponential difficulty and undecidability of arithmetic theories an exposition Proc. AMS and ASL Summer Institute on Recursive Theory (Ithaca, New York), Lect. Notes in Math. 42, 503-522, Springer-Verlag 86.02.78 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kumabe M. [1993] Every n -generic degree is a minimal cover of an n -generic degree J. Symbolic Logic, 58, № 1, 219-231 94.02.64 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Weber F.P. [1994] Initial segments of the lattice of ideals of r.e. degrees J. Symbolic Logic, 59, № 4, 1326-1350 95.08.75 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Arslanov M. M., Kalimullin I. Sh., Lempp S. [2010] On Downey’s conjecture J. Symbolic Logic, 75, № 2, 401-441 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Канович М.И. [1984] Решение задачи Роджерса о соотношении сильной и слабой теорем о рекурсии ДАН СССР, 279, № 5, 1040-1044 85.06.40 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Трахтенброт Б.А. [1955] Табличное представление рекурсивных операторов ДАН СССР, 101, № 3, 417-420 56.4282 RO статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Metakides G., Nerode A., Shore R.A. [1985] Recursive limits on the Hahn-Banach theorem Contemporary Math., 39, 85-91 86.Б3.1134 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Remmel J.B. [1978] An r -maximal vector space not contained in any maximal vector space J. Symbolic Logic, 43, № 3, 430-441 79.06.61 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Carroll J.S. [1986] Some undecidability results for lattices in recursion theory Pacif. J. Math., 122, № 2, 319-331 86.12.63 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Мальцев А. И. [1960] Об одном соответствии между кольцами и группами Мат. сборник, 50, № 3, 257-266 61.02.155 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Vučkovich V.D. [1982] Relativized cylindrification Z. math. Logik und Grundl. Math., 28, № 2, 167-172 83.01.32 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Bianchini C.,Sorbi A. [1996] A note on closed degrees of difficulty of the Medvedev lattice Math. Logic Quarterly, 42, № 1,127-133 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hay L., Miller D. [1982] The Addison game played backwards: index sets in topology Proc. Patras Logic Symp. (Patras, Greece, 1980), North-Holland, 231-237 84.03.84 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hay L. [1975] Rice theorems for d.r.e. sets Canad. J.Math., 27, № 2, 352-365 75.12.53 EO article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Daley R.P. [1981] Busy beaver sets and the degrees of unsolvability J. Symbolic Logic, 46, № 3, 460-474 82.04.69 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Соловьев В.Д. [1989] Полнота систем общерекурсивных функций и предикатов, I Изв. Вузов. Мат., № 8, 56-63 90.03.47 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Spector C. [1956] On degrees of recursive unsolvability Ann. Math., 64, № 3, 581-592 58.4456 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Матиясевич Ю.В. [1967] Простые примеры неразрешимых канонических ассоциативных исчислений Труды Мат. ин-та АН СССР, 93, 50-88 68.05.69 R статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Normann D. [2002] Continuity, proof systems and the theory of transfinite computations Arch. Math. Logik Grundl., 41, № 8, 765-788 04.12.80 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jockusch C.G. Jr. [1969] The degrees of bi-immune sets. Z. math. Logik und Grundl. Math., 15, № 2, 135-140 70.04.80 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Herrmann E. [1981] Der Verbandseigenschaften der Rekursiv aufzählbaren Mengen Seminarb., Humboldt-Univ., Sek. Math., Berl , № 36, IV, 275 82.04.76 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Scott D. [1976] Data types as lattices SIAM J. Comput., 5, № 3, 522-587 77.B11.937 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.