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
Carpentier A. [1969] Complete enumerations and double sequences Z. math. Logik und Grundl. Math., 15, № 1, 1-6 69.12.137 EO article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Badaev S.A., Talasbaeva Z.T. [2006] Computable numberings in the hierarchy of Ershov Proc. 9 Asian Logic Conf., (Singapore, 2006), 17-30, World Scientific, Singapore Univ. Press ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Shore R.A. [1972] Minimal α-degrees Ann. Math. Logic, 4, № 4, 383-414 73.04.86 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Di Paola R.A. [1968] A note on diminishing the undecidable region of a recursively enumerable set Duke Math. J., 35, № 2, 399-405 69.02.71 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Sacks G.E. [1966] Post’s problem, admissible ordinals and regularity Trans. Amer. Math. Soc., 124, № 1, 1-23 68.01.69 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Millar T. S. [1985] Decidable Ehrenfeucht theoris Proc. Summer Institute on Recursive Theory (Ithaca, New York), Lect. Notes in Math. 42, 311-322, Springer-Verlag 86.04.89 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lerman M. [1998] A necessary and sufficient condition for embedding ranked finite partial lattice into the computably enumerable degrees Ann. Pure Appl. Logic, 94, № 1-3, 143-180 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Arslanov M. M., Kalimullin I. Sh., Sorbi A. [2001] Density results in the Δ 2 0 - e -degrees Arch. Math. Logik Grundl., 40, № 8, 597-614 04.12.87 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Chaitin G. [1976] Information-theoretical characterizations of recursive infinite strings Theor. Comput. Sci., 2, № 1, 45-48 77.02.57 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Mohrherr J. [1983] Kleene index sets and functional m-degrees J. Symbolic Logic, 48, № 3, 829-840 84.07.55 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Blum M. [1965] Enumeration of recursive sets by Turing machine Z. math. Logik und Grundl. Math., 11, № 3, 197-201 66.07.54 E article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G., Greenberg N. ? Totally ω - computable enumerable degrees, II ? ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Welch P. D. [1985] Comparing incomparable Kleene degrees J. Symbolic Logic, 50, № 1, 55-58 86.03.18 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G. [1988] Two theorems on truth-table degrees Proc. Amer. Math. Soc., 103, № 1, 281-287 89.01.30 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Barmpalias G., Downey R.,Greenberg N. [2010] Working with strong reducibilities above totally ω-c.e. and array computable degrees Trans. Amer. Math. Soc.,362, № 2, 777-813 ВН10.12.37 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lerman M. [1972] On suborderings of the α-recursively enumerable α -degrees Ann. Math. Logic, 4, № 4, 369-392 73.04.85 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Remmel J. B [1980] Complementation in the lattice of subalgebras of a Boolean algebra Algebra Universalis, 10, № 1, 48-64 80.10.221 G article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Nerode A., Shore R. A. [1980] Second-order logic and first-order theories of reducibility orderings Proc. “The Kleene Symposium”, (Madison, Wisconsin, USA, 1979), North-Holland, 181-200 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Odifreddi P. [1989], [1992] Classical Recursive Theory, The theory of functions and sets of natural numbers, v. I, II Elsevier ? GOS book Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Marques I. [1975] On degrees of unsolvability and complexity properties J. Symbolic Logic, 40, № 4, 529-540 76.12.67 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Selivanov V.L. [2005] Some reducibilities on regular sets Lect. Notes in Comp. Sci., 4497, 430-440, Springer-Verlag article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Робинсон А. [1967] Введение в теорию моделей и метаматематику алгебры М., Наука (Перевод книги Robinson A. “Introduction to model theory and to the metamathematics of algebra”, 1963.) 68.05.117 книга Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Klette R. [1976] Indexmengen und Erkewnung rekursiver Functionen Z. math. Logik und Grundl. Math., 22, № 3, 231-238 77.05.42 E article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Selman A. L. [1971] Arithmetical reducibility, I Z. math. Logik und Grundl. Math., 17, № 4, 335-350 72.06.71 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Yang Yue , Yu Liang [2005] On the definable ideal generated by nonbounding c.e.degrees J. Symbolic Logic, 70, № 1, 252-270 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Rabin M. [1977] Comlexity of computations Communs ACM, 20, № 3, 625-633. 78.B5.804 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Selivanov V.L. [2007] Hierarchies of Δ 2 0 -measurable k -partitions Мath. Logiс Quaterly, 53, № 4-5, 446-461 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Georgieva N. [1976] Another simplification of the recursive schema Arch. Math. Logik Grundl., 18, № 1-2, 1-3 77.06.69 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Turing A.M. [1937] Computability and λ- definability J. Symbolic Logic, 2, № 4, 153-163 ~ ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Pour-El M. B. [1968] Effectively extension theories J. Symbolic Logic, 33, № 1, 56-68 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Post E.L. [1947] Recursive unsolvability of a problem of Thue J. Symbolic Logic, 12, № 1, 1-11 ~ ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Madan D.B., Robinson R.W. [1982] Monotone and 1-1 sets J. Austral. Math. Soc., A33, № 1, 62-75 83.01.27 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ash C.J., Knight J. [2000] Computable structures and the hyperarithmetical hierarchy Studies Logic and Found. Math., 144, Elsevier ? book Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Davis M. [1965] Computability Proc. Symp. System. Theory, NY, (New York, 1962), Brooklyn, NY, Polytech. Press, 127-131 68.В4.477 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Shore R.A. [1981] The degrees of unsolvability: global results Lect. Notes in Math., 859, 283-301, Springer-Verlag 82.01.45 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Machover M. [1961] The theory of transfinite recursion Bull. Amer. Math. Soc., 67, № 6, 575-578 62 .07.60 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Дегтев А.Н. [1978] Об m -степенях надмножеств простых множеств Мат. заметки, 23, № 6, 889-893 78.12.65 S статья Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G., Lempp S. [1999] On the proof theoretical strength of the Dushnik-Miller theorem for countable linear orderings Recursive Theory and Complexity, Kazan’97 Workshop, (Kazan, 1997), v. 2, 55-57, de Gruyter ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jockusch C.G. Jr., Slaman T.A. [1993] On the Σ 2 -theory of the upper semilattice of Turing degrees J. Symbolic Logic, 58, № 1, 193-204 94.01.40 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cay L., Chen J., Downey R. G. , Fellows M. R. [1997] On the parameterized complexity of short computation and factorization Arch. Math. Logik Grundl., 36, № 4-5, 321-337 01.12.106 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Metakides G., Nerode A. [1979] Effective content of field theory Ann. Math. Logic, 17, № 3, 289-320. 08.09.102 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Woodin H. W. [2008] A tt version of the Posner-Robinson theorem Proc. IMS Workshop "Computational Prospects of Infinity", (Singapore, 2005), Lect. Notes Series, 15, Institute Math. Sci., Nat. Univ. Singapore, 355-392 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lerman M. [1974] Least upper bounds for minimal pairs of α-recursively enumerable α-degrees J. Symbolic Logic, 39, № 1, 49-56 75.02.98 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Marandzjan G. B. [1979] On the sets of minimal indices of partial recursive functions Lect. Notes in Comp. Sci, 74, 372-374, Springer -Verlag 81.03.52 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G., Lempp S., Shore R. A. [1993] Highness and bounding minimal pairs Math. Logic Quarterly 39, 475-491 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Landweber L.H., Robertson E.L. [1972] Recursive properties of abstract complexity classes J. Ass. Comput. Mach., 19, 296-308 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Robinson J. [1955] Note on primitive recursive functions Proc. Amer. Math. Soc., 6, № 4 , 667-670 56.7064 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Miller R. G. [2002] Orbits of computable enumerable sets: low sets can avoid an upper cone Ann. Pure Appl. Logic, 118, № 1-2, 61-85 08.01.201 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Fejer L., Soare R.I. [1981] The plus-cupping theorem in the recursively enumerable degrees Lect. Notes in Math., 859, 49-62, Springer-Verlag 82.02.53 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G. [1990] Notes on the 0 /// priority method with special attention to density results Lect. Notes in Math., 1432, 111-140, Springer-Verlag ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.