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

Lempp S. [1987] Hyperarithmetical index sets in recursion theory Trans. Amer. Math. Soc., 303, № 2, 559-583 ? OS article Вернуться к поиску

Lempp S. [1988] A high strongly noncappable degree J. Symbolic Logic, 53, № 1, 174-187 88.10.45 S article Вернуться к поиску

Lempp S., Lerman M. [1995] A general framework for priority arguments Bull. Symbolic Logic, 1, № 2, 189-201 97.06.137 O article Вернуться к поиску

Lempp S., Nies A. [2000] Differences of computably enumerable sets Math. Logic Quarterly, 46, № 4, 555-561 ? article Вернуться к поиску

Lempp S., Smuga-Otto Maciej J. ? Final segments of the d.c.e. degrees ? ? article Вернуться к поиску

Ambos-Spies K., Lempp S., Soare R.I. ? Intervals of recursively enumerable degrees to appear ? article Вернуться к поиску

Ambos-Spies K., Lempp S., Slaman T.A. ? Generating sets for the recursively enumerable Turing degrees ? ? article Вернуться к поиску

Downey R. G., Lempp S., Wu G. ? On the complexity of the successivity relation in computable linear orders ? ? article Вернуться к поиску

Cooper S.B., Lempp S., Watson P. [1989] Weak density in the d -r.e. degrees Israel J. Math., 67, № 2, 137-152 ? O article Вернуться к поиску

Downey R. G., Lempp S., Shore R. A. [1993] Highness and bounding minimal pairs Math. Logic Quarterly 39, 475-491 ? O article Вернуться к поиску

Ambos-Spies K. Cooper S.B., Lempp S. [1998] Initial segments of recursive linear orders Order, 14, № 2, 101-105 ? article Вернуться к поиску

Ambos-Spies K., Kjos-Hanssen B., Lempp S., Slaman T.A. [2004] Comparing DNR and WWKL J. Symbolic Logic, 69, № 4, 1089-1104 ? article Вернуться к поиску

Arslanov M. M., Kalimullin I. Sh., Lempp S. [2010] On Downey’s conjecture J. Symbolic Logic, 75, № 2, 401-441 ? article Вернуться к поиску

Badaev S.A., Lempp S. [2009] A decomposition of the Rogers semilattice of a family of d.c.e. sets J. Symbolic Logic,74, № 2, 618-640 ? article Вернуться к поиску

Lempp S., Slaman T.A., Sorbi A. [2005] On extensions of embeddings into the Σ 2 0 -enumeration degrees J. Math. Logic, 5, № 2, 247-298 ? article Вернуться к поиску

Downey R. G., Lempp S. [1994] There is no plus-capping degree Arch. Math. Logik Grundl., 33, № 2, 109-119 95.01.63 article Вернуться к поиску

Lempp S., Lerman M. [1990] Priority arguments using iterated trees of strategies Lect. Notes in Math., 1432, 277-296, Springer-Verlag ? OG article Вернуться к поиску

Lempp S., Sorbi A. [2002] Embedding finite lattice into the Σ 2 0 - enumeration degrees J. Symbolic Logic, 67, № 1, 69-90 03.04.206 O article Вернуться к поиску

Lempp S., Lerman M., Weber F. [1993] Minimal pair constructions and iterated trees of strategics Logical methods, Birkhäuser, 12, 512-554 ? article Вернуться к поиску

Ingrassia M.A., Lempp S. [1990] Jumps of splitting of r. e. sets Z. math. Logik und Grundl. Math., 36, № 4, 285-292 91.12.35 article Вернуться к поиску

Hirst J.L., Lempp S. [1996] Infinite versions of some problems from finite complexity theory Notre Dame J. Formal Logic, 37, № 4, 545-553 ? article Вернуться к поиску

Downey R. G., Lempp S., Shore R. A. [1996] Jumps of minimal degrees below 0 / J. London Math. Soc., 53, № 3, 427-439 98.02.54 O article Вернуться к поиску

Downey R. G., LaForte G., Lempp S. [1999] A Δ 2 0 set with barely Σ 2 0 degree J. Symbolic Logic, 64, № 4, 1700-1718 05.08.86 article Вернуться к поиску

Blaylock R., Downey R. G. , Lempp S. [1997] Infima in the recursively enumerable wtt -degrees Notre Dame J. Formal Logic, 38, № 3, 406-419 ? article Вернуться к поиску

Jockusch C.G.Jr., Kastermans B.,Lempp S., Lerman M., Solomon D.R. [2009] Stability and posets J. Symbolic Logic, 74, № 2 , 693-711 ? article Вернуться к поиску

Lempp S., Yuefei Sui [1996] On extended Lachlan splitting theorem Ann. Pure Appl. Logic, 79, № 1, 53-59 99.12.50 article Вернуться к поиску

Lempp S., Slaman T.A. [1989] A limit on relative genericity in the recursively enumerable sets J. Symbolic Logic, 54, № 2, 376-395 90.06.65 S article Вернуться к поиску

Lempp S., Lerman M. [1997] Iterated trees of strategies and priority arguments Arch. Math. Logik Grundl., 36, № 4-5, 297-312 01.10.119 O article Вернуться к поиску

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

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

Khoussainov B. M., Lempp S., Slaman T.A. [2005] Computably enumerable algebras, their expansions, and isomorphisms Inter. J. Algeb. and Comp., 15, № 3, 437-454 06.12.299 article Вернуться к поиску

Arslanov M.M., Lempp S., Shore R. A. [1996] Interpolating d -r.e. and REA degrees between r.e. degrees Ann. Pure Appl. Logic, 78, № 1, 29-56 97.ВН6.62 O article Вернуться к поиску

Arslanov M.M., Lempp S., Shore R. A. [1996] On isolating r.e. and isolated d -r.e. degrees London Math. Soc. Lect. Notes, Cambridge Univ. Press, 224, 61-80 ? O article Вернуться к поиску

Lempp S. [1998] Decidability and undecidability in the enumerable Turing degrees Proc. 6 Asian Logic Conf. (Beijing , China, 1998), 151-161 World Scientific, Singapore Univ. Press ? article Вернуться к поиску

Lempp S., Nies A. [1995] The unsolvability of the Π 4 -theory for the r. e. wtt - and Turing degrees J. Symbolic Logic, 60, № 4, 1118-1136 01.10.27 O article Вернуться к поиску

Lempp S., Lerman M., Solomon D.R. [2004] Embedding finite lattices into the computably enumerable degrees – a status survey Lect. Notes in Logic, 27, 206-229, Wellesley ? 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 Вернуться к поиску

Ambos-Spies K., Lempp S., Lerman M. [1994] Lattice embeddings into the r. e. degrees preserving 1 Proc. IX Inter. Congress Logic, Methodology, Philosophy Sci., (Uppsala, 1991), North-Holland, 179-198 ? O article Вернуться к поиску

Cooper S.B., Harrington L. A., Lachlan A.H., Lempp S., Soare R.I. [1991] The d.r.e. degrees are not dense Ann. Pure Appl. Logic, 55, № 2, 125-151 92.06.52 O article Вернуться к поиску

Lempp S., Lerman M. [1992] The existential theory of the poset of r.e. degrees with a predicate for single jump reducibility J. Symbolic Logic, 57, № 3, 1120-1130 93.05.117 article Вернуться к поиску

Lempp S., Lerman M. [1997] A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees Ann. Pure Appl. Logic, 87, № 2, 167-185 ? OS article Вернуться к поиску

Lempp S., Nies A., Slaman T.A. [1998] The Π 3 -theory of the c. e.Turing degrees is undecidable Trans. Amer. Math. Soc., 350, № 7, 2719-2736 01.11.66 OS article Вернуться к поиску

Ambos-Spies K., Lempp S., Mainhardt G. [1998] Randomness vs. completeness: on the diagonalization strength of resource-bounded random sets Lect. Notes in Comp. Sci., 1450, 465-473, Springer-Verlag ? article Вернуться к поиску

Lempp S., Nies A., Solomon D. R. [2001] On the filter of computably enumerable supersets of an r -maximal set Arch. Math. Logik Grundl., 40, № 6, 415-423 05.08.95 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 Вернуться к поиску

Lempp S., Lerman M. [1996] The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations Adv. in Math., 120, № 1, 1-142 02.09.53 article Вернуться к поиску

Lempp S., McCoy Ch.F.D., Morozov A.S., Solomon D.R. [2003] On self-embeddings of computable linear orders Computability and models: perspectives East and West Kluwer Academic/Plenum Publishers, 259-265 ? 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 Вернуться к поиску

Ambos-Spies K., Fejer P.A., Lempp S., Lerman M. [1996] Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semilattices J. Symbolic Logic, 61, № 3, 880-905 98.02.52 O article Вернуться к поиску