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

Downey R. G., Solomon R. ? On minimal wtt degrees and computable enumerable Turing degrees ? ? 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 Вернуться к поиску

Kjos-Hanssen B., Lerman M., Solomon R., Stephen B. [2006] On a conjecture of Dobrinen and Simpson concerning almost every domination J. Symbolic Logic, 71, № 1, 119-136. ? article Вернуться к поиску

Cholak P., Marcone A., Solomon R. [2004] Reverse mathematics and the equivalence of definition for well and better quasi-order J. Symbolic Logic, 69, № 3, 683-712 ? article Вернуться к поиску

Goncharov S.S., Harizanov V.S., Knight J.F., McCoy Ch.F.D., Millar R.C., Solomon R. [2005] Enumerations in computable structure theory Ann. Pure Appl. Logic, 136, № 3, 219-246 ? 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 Вернуться к поиску

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

... A.Kh. Shepherdson J.C. Shi Nian Dong Shinoda J. Shlapentokh A. Shoenfield J.R. Shore R.A. Silibovski S. Simon J. Simpson S.G. Skolem T. Skordev D. Skvortsova E.Z. Slaman T. A. Slinko A. Smith R.L. Smuga-Otto M. J. Smullyan R.M. Soare R. I. SolomonDR SolomonR Solon B. Solovay R.M. Sorbi A. SoskovIN SoskovaAA SoskovaMI Spector C. Sperschneider V. Spreen D. Stanley L. Stearns R.E. Steel J.R. Stefani S. Stephan F. Stephen B. Stewart F.M. Steyaert J.M. Stillwell J. Stob M. Stockmeyer L.J. Stoltenberg-Hansen ...