Search results

Lerman M. [1976] Types of simple α-recursively enumerable sets J. Symbolic Logic, 41, № 2, 419-426 77.03.53 article Вернуться к поиску

Lerman M. [2000] Embedding into the computably enumerable degrees Contemporary Math., 257, 191-205 01.ВН12.61 article Вернуться к поиску

Lerman M. [1986] Degrees which do not bound minimal degrees Ann. Pure Appl. Logic, 30, № 3, 249-276 ? OS article Вернуться к поиску

Lerman M. [1983] The degrees of unsolvability. Local and Global Theory Springer-Verlag 84.03.42 SO book Вернуться к поиску

Lerman M. [1985] Upper bounds for the arithmetical degrees Ann. Pure Appl. Logic, 29, № 3, 225-254 ? S article Вернуться к поиску

Lerman M. [1974] Maximal α-recursively enumerable sets Trans. Amer. Math. Soc., 188, № 2, 341-386 74.12.69 O article Вернуться к поиску

Lerman M., Remmel J. [1984] The universal splitting properties, II J. Symbolic Logic, 49, № 1, 137-150 84.12.47 S article Вернуться к поиску

Lerman M., Remmel J. [1982] The universal splitting properties, I Logic Coll.’80, North-Holland, 181-208 ? S article Вернуться к поиску

Lerman M., Watnick R. [2003] Computable choice sets for computable linear ordering Math. Logic Quarterly, 49, № 5, 485-510 ? article Вернуться к поиску

Lerman M., Schmerl J.H. [1979] Theories with recursive models J. Symbolic Logic, 44, № 1, 59-76 ? SG article Вернуться к поиску

Lerman M., Simpson S.G. [1973] Maximal sets in α-recursion theory Israel. J. Math., 4, № 3, 236-247 74.02.43 O article Вернуться к поиску

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

Chong C.T., Lerman M. [1976] Hyperhypersimple α-r.e. sets Ann. Math. Logic. 9, №1-2, 1-48 76.07.95 O article Вернуться к поиску

Lerman M. [1971] Initial segments of the degrees of unsolvability Ann. Math., 93, № 2, 365-389 71.11.99 OS article Вернуться к поиску

Lerman M. [1981] On recursive linear orderings Lect. Notes in Math., 859, 132-142, Springer-Verlag 82.01.33 SG article Вернуться к поиску

Lerman M. [1972] On suborderings of the α-recursively enumerable α -degrees Ann. Math. Logic, 4, № 4, 369-392 73.04.85 O article Вернуться к поиску

Lerman M. [1983] The structure of recursion theory Proc. South. Asian Conf. on Logic, (Singapore, 1981), North-Holland, 77-95 ? S article Вернуться к поиску

Lerman M., Shore R.A., Soare R.I. [1978] r -maximal major subsets. Israel. J. Math., 31, № 1, 1-18 79.07.71 OS article Вернуться к поиску

Lerman M. [1970] Turing degrees and many-one degrees of maximal sets J. Symbolic Logic, 35, № 1, 29-40 71.03.70 OS article Вернуться к поиску

Lerman M. [1996] Embedding into the recursively enumerable degrees London Math. Soc. Lect. Notes, Cambridge Univ. Press,224, 185-204 ? O article Вернуться к поиску

Lerman M. [1970] Recursive functions modulo co- r -maximal sets Trans. Amer. Math. Soc., 148, № 2, 429-444 71.02.65 OS article Вернуться к поиску

Lerman M. [1973] Admissible ordinals and priority arguments Lect. Notes in Math.,.337, 311-344, Springer-Verlag 74.02.55 OS article Вернуться к поиску

Lerman M. [2008] The existential theory of the uppersemilattice of Turing degrees with least element and jump is decidable ? ? article Вернуться к поиску

Lerman M., Sacks G.E. [1972] Some minimal pairs of α-recursively enumerable degrees Ann. Math. Logic, 4, № 4, 415-442 73.04.87 article Вернуться к поиску

Lerman M. [1974] Least upper bounds for minimal pairs of α-recursively enumerable α-degrees J. Symbolic Logic, 39, № 1, 49-56 75.02.98 O article Вернуться к поиску

Lerman M., Soare R.I. [1980] d -simple sets, small sets, and degree classes Pacif. J.Math., 87, № 1, 135-155 81.03.51 OS article Вернуться к поиску

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

Ambos-Spies K., Lerman M. [1986] Lattice embedding into the recursively enumerable degrees J. Symbolic Logic, 51, № 2 , 257-272 86.12.66 OS article Вернуться к поиску

Ambos-Spies K., Lerman M. [1989] Lattice embeddings into the recursively enumerable degrees, II J. Symbolic Logic, 54, № 3, 735-760 90.11.40 O article Вернуться к поиску

Burkard E., Lerman M., Wald K. [2003] Homomorphisms and quotients of degree structure Ann. Pure Appl. Logic, 123, № 1-3, 193-233 ? article Вернуться к поиску

Englert B., Lerman M., Wald K. [2003] Homomorphisms and quotients of degree structures Ann. Pure Appl. Logic, 123, № 1-3, 193-233 ? article Вернуться к поиску

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

Lerman M. [1978] On elementary theories of some lattices of α-recursively enumerable sets Ann. Math. Logic, 14, № 3, 227-272 79.07.70 S article Вернуться к поиску

Lerman M., Rosenstein J. G. [1982] Recursive linear orderings Proc. Patras Logic Symp. (Patras, Greece, 1980), North-Holland, 123-136 84.04.55 SG article Вернуться к поиску

Lerman M., Shore R.A. [1988] Decidability and invariant classes for degree structures Trans. Amer. Math. Soc., 310, № 2, 669-692 89.12.76 O article Вернуться к поиску

Lerman M. [1978] Lattices of α-recursively enumerable sets General Recursion Theory, II, Proc. Symp. (Oslo, 1977), 223-238, North Holland 79.07.72 S article Вернуться к поиску

Lerman M. [1969] Some nondistributive lattices as initial segments of the degrees of unsolvability J. Symbolic Logic, 34 , № 1, 85-98 70.01.63 RO 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 Вернуться к поиску

Lerman M. [1971] Some theorems on r -maximal sets and major subsets of recursively enumerable sets J. Symbolic Logic, 36, № 2, 193-215 72.04.76 OS article Вернуться к поиску

Lerman M. [1980] The degrees of unsolvability: Some recent results London Math. Soc. Lect. Notes, Cambridge Univ. Press, 45, 140-157 81.04.57 S article Вернуться к поиску

Lerman M. [1985] On the ordering of classes in high/low hierarchies Lect. Notes in Math., 1141, 260-270, Springer-Verlag 86.05.68 OS article Вернуться к поиску

Lerman M. [1991] Minimal degrees and recursively inseparable pairs of recursively enumerable sets Z. math. Logik und Grundl. Math., 37, № 4, 331-342 92.10.45 article Вернуться к поиску

Calhoun W., Lerman M. [2001] Embedding finite lattices into the ideals of computably enumerable Turing degrees J. Symbolic Logic, 66, № 4, 1791-1802 05.09.85 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 Вернуться к поиску

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

Lerman M. [1976] Congruence relations, ideals, filters and definability in lattice of α- recursively enumerable sets J. Symbolic Logic, 41, № 2, 405-418 77.03.52 OS article Вернуться к поиску

Lerman M. [1976] Ideals of generalized finite sets in lattice of α-recursively enumerable sets Z. math. Logik und Grundl. Math., 22, № 4, 347-352 77.07.50 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 Вернуться к поиску