Библиография Лаврова И.А.

Csima B., Downey R. G., Greenberg N., Hirschfeldt D. R., Miller J. S. [2006] Every 1-generic computes a propely 1-generic J. Symbolic Logic, 71, № 4, 1385-1393 ? article Вернуться к поиску

Coles R. J., Downey R. G., Jockusch C.G. Jr. LaForte G. [2005] Completing psevdojump operators Ann. Pure Appl. Logic, 136, № 3, 297-333. ? article Вернуться к поиску

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 Вернуться к поиску

Downey R. G. [1986] Bases of supermaximal subspaces and Steinitz systems, II Z. math. Logik und Grundl. Math., 32, № 3, 203-210 87.02.38 G article Вернуться к поиску

Downey R. G., [2003] Computability, Definability and Algebraic Structures Proc. 7-8 Asian Logic Conf., (Singapore, 2002), 63-102, World Scientific, Singapore Univ. Press ? article Вернуться к поиску

Downey R. G., Shore R. A. [1997] There is no degree invariant half-jump Proc. Amer. Math. Soc., 125, № 10, 3033-3037 01.11.71 O article Вернуться к поиску

Downey R. G., Li A., Wu G. [2004] Complementing capable degrees in the difference hierarchy Ann. Pure Appl. Logic, 125, № 1-3, 101-118 ? article Вернуться к поиску

Downey R. G., Greenberg N., Mihailovich N. J., Nies A. [2005] Lowness for computable machines Proc. Comp. Prospects of Infinity, World Scientific, Singapore, ? article Вернуться к поиску

Chong C.T., Downey R. G. [1990] Minimal degrees recursive in 1-generic degrees Ann. Pure Appl. Logic, 48, № 3, 215-225 91.04.69 OS article Вернуться к поиску

Coles R. J., Downey R. G., Slaman T.A. [2000] Every set has a least jump enumeration J. London Math. Soc., 62, № 3, 641-649 05.09.73 article Вернуться к поиску

Downey R.G.,Fellows M.R. [1995] Fixed-parameter tractability and completess, II: On competes for W Theor. Comp. Sci., 141, № 1-2, 109-131 96. ВН12.38 article Вернуться к поиску

Downey R. G., Barmpalias G., Greenberg N. [2009] K -trivial degrees and the jump-traceability hierarchy Proc. Amer. Math. Soc., 137, № 6, 2099-2109 10.ВН2.87 article Вернуться к поиску

Downey R. G. [1990] Lattice nonembedding and initial segments of the recursively enumerable degrees Ann. Pure Appl. Logic, 49, № 2, 97-119 91.05.41 article Вернуться к поиску

Downey R. G., Greenberg N. [2006] Totally ω - computably enumerable degrees and m -topped degrees, I Lect. Notes in Comp. Sci., 3959, 46-60, Springer -Verlag ? article Вернуться к поиску

Downey R. G.,Fellows M.R., Regan K.W. [1998] Parameterized circiut complexity and the W hierarchy Theor. Comput.Sci., 191, № 1-2, 97-115 99.ВН11.116 article Вернуться к поиску

Downey R. G., Jockusch C.G. Jr. [1999] Effective presentability of Boolean algebras of Cantor-Bendixson rank 1 J. Symbolic Logic, 64, № 1, 45-52 00.12.229 article Вернуться к поиску

Cholak P., Downey R. G. [2004] Invariance and noninvariance in the lattice of Π 1 0 classes J. London Math. Soc., 70, № 3, 735-749 08.01.02 article Вернуться к поиску

Downey R. G., Hirschfeldt D. R., Lempp S., Solomon R. [2003] Computability-theoretical and proof-theoretical aspects of partial and linear orderings Israel J. Math., 138, 271-289 ? article Вернуться к поиску

Downey R. G., Füredi Z., Jockusch C. G. Jr., Rubel L. [1998] Difference sets and computability theory Ann. Pure Appl. Logic, 93, № 1, 63-72 ? article Вернуться к поиску

Downey R. G., Gasarch W. I., Homer S., Moses M. F. [1994] On honest polynomial time reduction and P = NP Ann. Pure Appl. Logic, 70, № 1, 1-27 ? O article Вернуться к поиску

Downey R. G. [1983] Abstract dependence, recursion theory and the lattice of recursively enumerable filters Bull. Aust. Math. Soc., 27, № 3, 461-464 84.03.85 G article Вернуться к поиску

Downey R. G. [1985] The degrees of recursively enumerable sets without the universal splitting property Trans. Amer. Math. Soc., 291, № 1, 337-351 86.06.88 S article Вернуться к поиску

Downey R. G.,Gasarch W., Moses M.F. [1994] The structures of the honest polynomial m -degrees Ann. Pure Appl. Logic, 70, № 2, 113-139 95.07.46 article Вернуться к поиску

Downey R. G., Stob M. [1992] Automorphisms of the lattice of recursively enumerable sets: Orbits Adv. in Math., 92, № 2, 237-265 94.02.274 OS article Вернуться к поиску

Downey R. G., Greenberg N., Miller J. S., Weber R. [2005] Prompt simplicity, array computability and cupping Proc. Comp. Prospects of Infinity, World Scientific, Singapore, ? article Вернуться к поиску

Downey R. G., Jockusch C.G. Jr. [1987] T -degrees, jump classes and strong reducibilities Trans. Amer. Math. Soc., 301, № 1, 103-136 88.01.34 OS article Вернуться к поиску

Downey R. G., Jockusch C.G. Jr. , Miller J. S. [2006] On self –embedding of computable linear orderings Ann. Pure Appl. Logic, 138, № 1-3, 52-76. ? article Вернуться к поиску

Downey R. G., Jockusch C.G. Jr. , Stob M. [1990] Array nonrecursive sets and multiple permitting arguments Lect. Notes in Math., 1432, 141-173, Springer-Verlag ? article Вернуться к поиску

Downey R. G. [1987] Localization of a theorem of Ambos-Spies and the strong antisplitting properly Arch. Math. Logik Grundl., 26, № 3-4 , 127-136 88.04.36 OS article Вернуться к поиску

Cholak P., Downey R. G. [1994] Recursively enumerable m - and tt -degrees, III. Realizing all finite distributive lattices J. London Math. Soc., 50, № 3, 440-453 95.08.179 O article Вернуться к поиску

Downey R. G., Jockusch C.G. Jr. , Stob M. [1996] Array nonrecursive sets and genericity London Math. Soc. Lect. Notes, Cambridge Univ. Press, 224, 93-105 ? article Вернуться к поиску

Downey R. G., Hirschfeldt D. R., Kach A.M., Lempp S., Mileti J.R., Montalban A. [2007] Subspaces of computable vector spaces J. Algebra, 314, 888-894 08.09.300 article Вернуться к поиску

Cenzer D., Downey R. G., Jockusch C.G. Jr., Shore R. A. [1993] Countable thin Π 1 0 classes Ann. Pure Appl. Logic, 59, № 2, 79-139 93.09.20 article Вернуться к поиску

Downey R. G. [1984] Some remarks on a theorem of Iraj Kalantari concerning convexity and recursion theory Z. math. Logik und Grundl. Math., 30, № 4, 295-302 85.03.38 article Вернуться к поиску

Downey R. G., Miller J.S. [2006] A basic theorem classes of positive measure and jump inversion for random reals Proc. Amer. Math. Soc., 134, № 1, 283-288 08.В6.5 article Вернуться к поиску

Downey R. G., Jockusch C.G. Jr. [1994] Every low Boolean algebra is isomorphic to a recursive one Proc. Amer. Math. Soc., 122, № 3, 871-880 95.04.69 G article Вернуться к поиску

Downey R. G., Gasarch W. I., Moses M. F. [1989] Honest polynomial reductions, non relativizationa and P =? NP Proc. 4 Ann. Conf. on Structure in Complexity Theory, IEEE Publ., 196-207 ? article Вернуться к поиску

Downey R. G. [1986] Undecidability of L ( F ∞ )and other lattices of recursively enumerable substructures Ann. Pure Appl. Logic, 32, № 1, 17-26; corr. 48 (1990), № 3, 299-301 91.02.82 G article Вернуться к поиску

Downey R. G., Moses M.F. [1989] On choise sets and strongly non-trivial self-embeddings of recursive linear orders Z. math. Logik und Grundl. Math., 35, № 3, 237-246 90.03.44 G article Вернуться к поиску

Downey R. G., Remmel J.B., Welch L.V. [1987] Degrees of splitting and bases of recursively enumerable subspaces Trans. Amer. Math. Soc., 302, № 2, 683-714 88.05.53. article Вернуться к поиску

Downey R. G., Fellows M.R., Regan K.W. [1998] Descriptive complexity and the W hierarchy Proof Complexity and Feasible arithmetic, Amer. Math. Soc., Providence, RI, 119-134 05.07.85 article Вернуться к поиску

Downey R. G., Lempp S. [1997], [2002] Contiguity and distributivity in the enumerable Turing degrees J. Symbolic Logic, 62, № 4, 1215-1240; corr. 67, № 4, 1579-1580 01.11.68 05.09.82 O article Вернуться к поиску

Downey R. G., Hirschfeldt D. R., Lempp S., Solomon R. [2001] A Δ 2 0 set with no low subset in it or its complement J. Symbolic Logic, 66, № 3, 1371-1381 04.12.89 article Вернуться к поиску

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 Вернуться к поиску

Cholak P., Downey R. G., Stob M. [1992] Automorphisms of the lattice of recursively enumerable sets: promptly simple sets Trans. Amer. Math. Soc., 332, № 2, 555-570 93.05.118 O article Вернуться к поиску

Cholak P., Downey R. G., Fortnow L. Gasarch W. I., Kinber E. B,, Kummer M., Kurtz S. A., Slaman T.A. [1992] Degrees of Inferability Proc. V Ann. Conf. Comp. Learning Theory, 180-192 ? article Вернуться к поиску

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 Вернуться к поиску

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 Вернуться к поиску

Cholak P., Coles R. J., Downey R. G. , Herrmann E. [2001] Automorphisms of the lattice of Π 1 0 classes; perfect thin classes and anc degrees Trans. Amer. Math. Soc., 353, № 12, 4899-4924 05.09.87 article Вернуться к поиску

Downey R. G., Hirschfeldt D. R., Lempp S., Solomon R . [2002] Reverse mathematics of the Nielsen-Schreier theorem Proc. Inter. Conf. “Logic and Its Appl.”, devoted to Yu.Ershov and A.I. Mal’cev, (Novosibirsk, 2002), Novosibirsk, NSU, 59-71 05.05.172 article ...