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
General Theory of Computability (bibliography) by Lavrov I.A. Introduction This database was created to provide specialists in different areas of computability theory a full view on a variety of current research directions in continuously developing field of theory of algorithms....
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1987] Enumeration reducibility using bounded information; counting minimal covers Z. math. Logik und Grundl. Math., 33 , № 8, 537-560 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Läuchli H., Leonard J. [1966] On the elementary thepry of linear order Fund. Math., 59, № 1, 109-116 67.04.80 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Normann D. [1978] Set recursion General Recursion Theory, II, Proc. Symp. (Oslo, 1977), 303-320,North Holland 79.05.64 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Simpson S. G. [1985] Reverse Mathematics Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 461-471 86.03.26 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Fabian R.J., Kent C.F. [1969] Recursive functions defined by ordinal recursions Proc. Amer. Math. Soc., 23, № 1, 206-210 70.06.78 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Normann D. [2002] Exact real number compatation relative to hereditarily total functions Theor. Comp. Sci., 284, № 2, 437-453 04. ВН1.167 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Robinson R.W. [1967] Simplicity of recursively enumerable sets J. Symbolic Logic, 32, № 2, 162-172 68.07.76 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ambos-Spies K., Lempp S., Lerman M. [1994] Lattice embeddings into the r. e. degrees preserving 0 and 1 J. London Math. Soc., 49, № 1, 1-15 94.10.123 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Skolem T. [1944] Some remarks on recursive arithmetic Kon. Nors. Vid., Sel., Forh., 17, 103-106 ~ RO article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Turing A.M. [1950] The word problem in semi-groups with cancellation Ann. Math., 52, № 2 , 491-505 ~ article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lerman M. [1976] Types of simple α-recursively enumerable sets J. Symbolic Logic, 41, № 2, 419-426 77.03.53 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Csima B., Montalban A., Shore R.A. [2006] Boolean algebras, Tarski invariants and index sets Notre Dame J. Math. Logic, 47, № 1, 1-23 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Арсланов M.M., Калимуллин И.Ш., [2003] Исследования по теории вычислимости Сб. "На рубеже веков",Каз. мат. об-во, 50-68 ? статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Metakides G., Nerode A. [1982] The introduction of non recursive methods in mathematics Proc. Conf. “The I. E .J. Brouwer Centenary Symp.”, (Noorwijkerhout, 1981), North-Holland, 319-335 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Harizanov V. S. [1993] The possible Turing degree of the nonzero member in a two element degree spectrum Ann. Pure Appl. Logic, 60, № 1, 1-30 93.11.91 G article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Simpson S.G. [2007] An extension of the recursively enumerable Turing degrees J. London Math. Soc., 75, 287-297 09.03.144 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Yuefei Sui, Zhang Z. [1999] The cupping theorem in R/M J. Symbolic Logic, 64, № 2, 643-650 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Дичев А. [1981] Пример на множество M от естественных чисел което не е m -эквивалентно на M 2 Мат. и мат. образ. , София, България, 137-141 82.01.47 статья (болг.) Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ambos-Spies K., Nies A. [1992] The theory of the polynomial many-one degrees of recursive sets is undecidable, Lect. Notes in Comp. Sci., 577, 209-210, Springer-Verlag ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Goetze B. [1976] The structure of the lattice of recursive sets Z. math. Logik und Grundl. Math., 22, № 2, 187-191 77.01.50 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Normann D. [1996] A hierarchy of domains with totality, but without density London Math. Soc. Lect. Notes, Cambridge Univ. Press, 224, 233-257 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ho K., Stephan F. [1999] Simple sets and strong reducibilities Forschungsberichte Math. Logic, 45, Math. Inst., Univ. Heidelberg ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Rice H.G. [1954] Recursive real numbers Proc. Amer. Math. Soc., 5, № 5, 784-791 55.2524 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hirschfeldt D. R. [2000] Degree spectra of relations on computable structures Bull. Symbolic Logic, 6, № 2, 197-212 06.10.72 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Steel J. R. [1975] Descending sequences of degrees J. Symbolic Logic, 40, № 1, 59-61 76.01.84 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Stob M. [1985] Major subsets and the lattice of recursively enumerable sets Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 107-116 86.03.58 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jones J.P. [1982] Universal diophantine equation J. Symbolic Logic, 47, № 3, 549-571 83.03.55 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Минский М. [1971] Вычисления и автоматы Мир, М. (Перевод книги Minsky M.L., “Computations:Finite and infinite machines”, 1967.) 71.В10.575 O книга Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Trachtenbrot B.A. [1977] Frequency algorithms and computations Lect. Notes in Comp. Sci., 4497, 148-161, Springer-Verlag 78.В4.680 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedberg R.M. [1958] Three theorems on recursive enumeration J. Symbolic Logic, 23 , № 3, 309-316 61.01.64 REOSG article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Knight J. F. [1990] A metatheorem for constructing by finitely many workers J. Symbolic Logic, 55, № 2, 787-804 91.08.85 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jockusch C.G. Jr. [1975] Recursiveness of initial segmens of Kleene’s O Fund. Math., 87, № 2, 161-167 75.12.51 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Fenstad J.E. [1978] On the foundation of general recursion theory: computations versus inductive definability General Recursion Theory, II, Proc. Symp. (Oslo, 1977), North Holland, 99-110 79.05.63 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hinman P.G., Slaman T.A. [1991] Jump embedding in the Turing degrees J. Symbolic Logic, 56, № 2, 563-591 92.08.64 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.McLaughlin T. G. [2000] A note on eventually computable functions Tex. J. Sci., 52, № 1, 59–64 05.08.105 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Nies A. ? Ideals in recursively enumerable degrees ? ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.McLaughlin T.G. [1967] Splitting and decomposition by regressive sets, II Canad. J. Math., 19, № 2, 291-311 68.07.71 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Owings J.C. [1971] A splliting theorem for simple Π 1 1 sets J. Symbolic Logic, 36, № 3, 433-438 72.06.72 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kechris A.S. [1975] Coutable ordinals and the analytical hierarchy, I Pacif. J. Math., 60, № 1, 223-227 76.06.41 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ambos-Spies K., Shore R.A. [1993] Undecidability and 1-types in the recursively enumerable degrees Ann. Pure Appl. Logic, 24, № 1, 3-37 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Adleman L.M., Blum M. [1991] Inductive inference and unsolvability J. Symbolic Logic, 56, № 3, 891-900 92.05.53 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Selivanov V.L. [1994] Rесursivеness of omеga-opеrations Мath. Logiс Quarterly, 40, № 2, 204-206 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Harrington L. A., Slaman T.A. ? Interpreting arithmetic in the Turing degrees of the recursively enumerable sets ? ? S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Sacks G.E. [1971] On the reducibility of Π 1 1 sets Adv. in Math., 7, № 1, 57-82 72.05.52 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Harrington L. A., Soare R.I. [1992] Games in recursion theory and continuity properties of capping degrees Proc. Workshop on set theory and the continuum, 39-62, Math. Sci. Research Inst., Berkeley ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Thuraisingham M.B. [1988] Representation of one-one degrees by n -cylindriral decision problems Z. math. Logik und Grundl. Math., 34, № 6, 481-490 89.08.66 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Schaeffer B. [1998] Dynamic notions of genericity and array noncomputability Ann. Pure Appl. Logic, 95, № 1-3, 37-69 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Соар Р. [2000] Вычислимо перечислимые множества и степени Казань, Казанское матем. общество (Перевод книги Soare R.I. “Recursively enumerable sets and degrees”, 1987.) ? книга Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Binns S. [2003] A splitting theorem for the Medvedev and Muchnik lattices Math. Logic Quartely, 49, № , 327-335 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.