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
Калимуллин И.Ш. [2001] Об элементарных теориях полурешеток n -р.п. степеней по перечислимости Изв. Вузов. Мат., №4, 24-27 02.04.69 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Цейтин Г.С. [1956] Ассоциативное исчисление с неразрешимой проблемой эквивалентности ДАН СССР, 107, № 3, 370-371 57.3718 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Becker H., [1988] A characterization of jump operators J. Symbolic Logic, 53, № 3, 708-728 89.07.55 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Соколов В.А. [1967] Об изоморфизмах максимальных подалгебр алгебры Р.Робинсона Алгебра и логика, 6, № 3, 91- 99 68.05.124 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Semenov A.L. [1984] Decidability of monadic theories Lect. Notes in Comp. Sci., 176, 162-175, Springer -Verlag 85.04.78 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Успенский В.А. [1955] Системы перечислимых множеств и их нумерации ДАН СССР, 105, № 6, 1155-1158 57.4549 REOS статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Селиванов В.Л. [1977] О нyмepaцияx кaнoничeски вычислимых семeйств кoнечныx мнoжeств Сибирск. матем. журнал, 18, № 6, l373-1381 78.06.66 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Мучник А.А. [1956] Неразрешимость проблемы сводимости теории алгоритмов ДАН СССР, 108, №2, 194-197 57.49 ROS статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Селиванов В.Л. [2005] Вариации на тему сводимости Вэджа Матем. труды, 8, № 1, 135-175, ИСИ СО РАН 05.12.506 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Sacks G.E. [1964] The recursively enumerable degrees are dense Ann. Math, 80, № 2, 300-312 65.02.122 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ogiwara M., Watanabe O. [1991] On polynomial-time bounded truth-table reducibility of NP to sparse sets SIAM J. Comput., 20, № 3, 471-483 92.Г7.111 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [2006] Definability as hypercomputational effect App. Math. and Comput., 178, № 1, 72-82 08.ВН3.58 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ash C. J., Knight J.F., Slaman T.A. [1993] Relatively recursive expansions, II Fund. Math., 142, № 2, 147-161 94.02.75 R article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lempp S. [1987] Hyperarithmetical index sets in recursion theory Trans. Amer. Math. Soc., 303, № 2, 559-583 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ершов Ю.Л. [1969] Гипергиперпростые m -степени Алгебра и логика, 8, № 5, 523-552 70.09.61 EOS статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Addison J.W. , Kleene S. C. [1957] A note on function quantification Proc. Amer. Math. Soc., 8, № 5, 1002-1006 59.7662 RO article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Хуторецкий А.Б. [1965] О рекурсивном изоморфизме Алгебра и логика, 4 , № 3, 85-88 66.03.60 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G. [1989] Intervals and sublattices in the r.e. weak truth table degrees, II: nonbounding Ann. Pure Appl. Logic, 44, № 3, 153-172 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Machtey M. [1974] The honest subrecursive classes are a lattice Inform. and Control, 24, № 3, 247-263 74.09.67 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Shepherdson J.C. [1965] Machine configuration and word problem of given degree of unsolvability Proc. II Inter. Congress Logic, Methodology, Philosophy Sci., (Amsterdam, 1965), Amsterdam, 69-80 69.02.80 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Вьюгин В.В. [1974] Сегменты рекурсивно перечислимых m -степеней Алгебра и логика, 13, № 6, 635-654. 75.08.100 ES статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Fortnow L., Gasarch W. I., Jain S., Kinber E. B., Kummer M., Kurtz S. A., Pleszkoch M., Slaman T.A., Solovay R. M., Stephan F. [1994] Extremes in the degrees of inferability Ann. Pure Appl. Logic , 66, №.3, 231--276 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Фрейвальд Р.В. [1974] О предельном синтезе номеров общерекурсивных функций в различных вычислимых нумерациях ДАН СССР, 219, № 4, 812-814 75.04.70 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kontostathis K. [1992] Topological framework for infinite injury Z. math. Logik und Grundl. Math., 38 , № 3, 189-195 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ершов Ю.Л. [1965] Неразрешимость некоторых полей ДАН СССР, 161, № 1, 27-29 65.07.65 E статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Young P.R. [1968] An effective operator, continuous but not partial recursive Proc. Amer. Math. Soc., 19 , № 1, 103-108 68.09.64 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Maass W., Slaman T.A. [1992] The complexity types of computable sets J. Comp. and Syst. Sci., 44, № 2, 168-192 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Normann D. [1978] The continuos functional with noncollapsing hierarchy J. Symbolic Logic, 43, № 3, 487-491 79.06.71 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Кузьмина Т.М. [1983] Сводимость морфизмами Вероят. методы и кибернетика, Казань, Из-во КГУ, № 19, 29-39 83.10.51 статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Börger E., Heidler K. [1976] Die m -Grade logischer Entscheidungsprobleme Arch. Math. Logik Grundl., 17, № 3-4, 105-111 76.09.83 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kleene S.C. [1955] Hierarchies of number-theoretical predicates Bull. Amer. Math. Soc., 61, № 3, 193-213 56.4279 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Марков А.А. [1958] Неразрешимость проблемы гомеоморфии ДАН СССР, 121, №2, 218-220 59.4362 RS статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Dobritsa V. P. [1998] Computable classes of constructive models Handbook of Recursive Mathematics, v.1, 183-233,Elsevier ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Grzegorczyk A. [1964] Recursive objects in all finite types Fund. Math., 54, № 1, 73-93 65.04.68 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Terwijn S., Zambella D. [2001] Computational randomness and lowness J. Symbolic Logic, 66, № 3, 1199-1205 04.12.83 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Howard W.A. [1972] A systems of abstract constructive ordinals J. Symbolic Logic, 37, № 2, 355-374 73.04.136 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lerman M. [1971] Some theorems on r -maximal sets and major subsets of recursively enumerable sets J. Symbolic Logic, 36, № 2, 193-215 72.04.76 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Tanaka H. [1970] On a Π 1 0 set of positive measure Nagoya Math. J., 38, 139-144 70.11.53 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lavrov I.A. [1985] The use of the Theory of algorithms in General Systems Theory A Science of Goal Formulation, Hemisphere Publ. Corp., 1991, 151-160 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ohashi K. [1970] On a question of G. E. Sacks J. Symbolic Logic, 35, № 1, 46-50 71.04.49 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Nies A. [2005] Lowness properties and randomness Adv. in Math., 197, № 1, 274-305 08.05.04 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lewis A. [2004] Finite cupping sets Arch. Math. Logik Grundl. 43, № 7, 845-858 06.02.28 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lynch N.A., Meyer A.R., Fischer M.J. [1972] Prioity arguments in complexiy theory Recursive Function Theory Newsletter, 2, 7-10 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lachlan A.H. [1972] Two theorems on many-one degrees of recursively enumerable sets Algebra and Logic, 11, № 2, 216-229 72.11.37 EOS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Shore R.A., Sorbi A. [1999] Jumps of Σ 2 high e -degrees and properly Σ 2 e -degrees Recursion Theory and Complexity, de Gruyter Series in Logic and Its Applications 2, de Grueter, 157-172 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Arslanov M.M. [1983] A hierarchy of degree of unsolvability Proc. VII Inter. Congress Logic, Methodology, Philosophy Sci., (Salzburg, 1983), North-Holland, 11-14 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lerman M. [1970] Turing degrees and many-one degrees of maximal sets J. Symbolic Logic, 35, № 1, 29-40 71.03.70 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedman H.M., Stanley L. [1989] A Borel reducibility theory for classes of countable structures J. Symbolic Logic, 54, № 3, 894-914 90.11.70 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kummer M. [1988] The length problem for co-recursively enumerable sets Z. math. Logik und Grundl. Math., 34 , № 3, 277-282 89.01.31 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Rabin M. [1969] Decidability of second order theories and automata on infinite trees Trans. Amer. Math. Soc., 141, № 7 , 1-35 (Русский перевод в Киберн. сб., 8, 72-116.) 70.90.332 OG article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.