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

Lerman M. [2000] A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees Ann. Pure Appl. Logic, 101, № 2-3, 275-297 ? O article Вернуться к поиску

Lerman M., Shore R.A., Soare R.I. [1984] The elementary theory of the recursively enumerable degrees is not ℵ 0 -categorical, Adv. in Math., 53, № 3, 301-320 ? OS 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 Вернуться к поиску

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

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

Lerman M., Soare R.I. [1980] A decidable fragment of the elementary theory of the lattice of recursively enumerable sets Trans. Amer. Math. Soc., 257, № 1, 1-37 80.10.46 OS 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 Вернуться к поиску

Lerman M. [1985] The embedding problem for the recursively enumerable degrees Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 13-20 86.02.47 S 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 Вернуться к поиску

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

L La Roche P. Lachlan A. H. Lacombe D. Ladner R.E. LaForte G. Lakins T. Lambert W. M. Landweber L.H. Langford G. Läuchli H. Lavrov I.A. Lebeuf R. Leeds S. Leggett A. Leivant D. Lempp S. LeonardJ Leonhardi S.D. Lerman M. LewisA LewisFD LewisHR LewisPM LiAngs LiXiang Lipton R.J. Liu S.C. Loh Chang-wan LongTJ Longo G. Longpre L. Louveau A. Lowenthal F. Lu Hong Lubarsky R.S. Luckham D. Lynch N.A. Lyndon R.C. Вернуться на главную страницу