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

Jockusch C.G. Jr., Soare R.I. [1972] Π 1 0 classes and degrees of theories Trans. Amer. Math. Soc., 173 , № 11, 33-56 73.08.52 OS article Вернуться к поиску

Jockusch C.G. Jr., Shore R.A. [1984] Pseudo-jump operators, II : transfinite iterations, hierarchies and minimal covers J. Symbolic Logic, 49, № 4, 1205-1236 85.09.32 OS 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 Вернуться к поиску

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

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

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

Chong C.T., Jockusch C.G. Jr. [1984] Minimal degrees and 1-generic sets below 0 / Lect. Notes in Math., 1104, 63-67, Springer -Verlag 85.08.54 OS article Вернуться к поиску

Jockusch C.G. Jr., Kalantari I. [1984] Recursively enumerable sets and van der Warden’s theorem on arithmetic progressions, Pacif. J. Math., 115, № 1, 143-153 85.08.62 S article Вернуться к поиску

Baterman P.T.,Jockusch C.G. Jr., Woods A.R. [1993] Decidability and undecidability of theories with a predicate for the primes J. Symbolic Logic, 58, № 2, 672-687 94.08.122 article Вернуться к поиску

Jockusch C.G. Jr., Soare R.I. [1991] Degrees of orderings not isomorphic to recursive linear orderings Ann. Pure Appl. Logic, 52, № 1-2, 39-64 91.12.32 G article Вернуться к поиску

Jockusch C.G. Jr., Li A., Yang Yue [2004] A join theorem for the computably enumerable degrees Trans. Amer. Math. Soc., 356, № 7, 2557-2568 07.06.67 article Вернуться к поиску

Jockusch C.G. Jr. [1987] Degrees of functions with no fixed-points Proc. VIII Inter. Congress Logic, Methodology, Philosophy Sci., (Moscow, 1987), Moscow, 116 - 118 88.01.35; O article Вернуться к поиску

Jockusch C.G. Jr., Mohrherr J. [1985] Embedding the diamond lattice in the recursively enumerable truth-table degrees Proc. Amer. Math. Soc., 94, № 1, 123-128 86.02.299 OS article Вернуться к поиску

Cholak P., Jockusch C.G. Jr., Slaman T.A. [2001] On the strength of Ramsey’s theorem for pairs J. Symbolic Logic, 66, № 1, 1-55; corr. 74, № 4, 1438-1439 03.11.96 article Вернуться к поиску

Chisholm J., Chubb J., Harizanov V.S., Hirschfeldt D. R., Jockusch C. G. Jr. McNiholl T., Pingrey S. [2007] Π 1 0 classes and strong degree spectra of relation J. Symbolic Logic, 72, № 3, 1003-1018 ? article Вернуться к поиску

Jockusch C.G. Jr., Lerman M., Soare R.I., Solovay R.M. [1989] Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion J. Symbolic Logic, 54, № 4, 1288-1323 90.12.34 OS article Вернуться к поиску

Jockusch C.G. Jr., Shore R.A. [1985] REA operators, RE degrees and minimal covers Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 3-111 86.03.54 OS article Вернуться к поиску

Ambos-Spies K., Jockusch C.G. Jr., Shore R. A., Soare R. I. [1984] An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees Trans. Amer. Math. Soc., 281, № 1, 109-128 84.09. OS article Вернуться ...

Hirschfeldt D. R., Kjos-Hanssen B., Jockusch C.G. Jr., Lempp S., Slaman T.A. [2008] The strength of some combinatorial principles related to Ramsey’s theorem for pairs Proc. IMS Workshop “Computational Prospects of Infinity”, (Singapore, 2005), Lect. Notes Series, 15, Institute Math. Sci., Nat....

J Jacobs B. E. Jacobs K. Jahn M.A. Jain S. Janiczak A. Jaśkowski S. Jeffrey R.C. Jensen R. B. Jiang Zhingen Jockusch C. G. Jr. Johnson N. JonesJP Joseph D. Вернуться на главную страницу