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

Maass W. [1982] Recursively enumerable generic sets J. Symbolic Logic, 47, № 4, 809-823 83.07.55 OS article Вернуться к поиску

Maass W. [1979] On α- and β-degrees Ann. Math. Logic, 16, № 3, 205-231 80.05.51 article Вернуться к поиску

Maass W. [1984] On the orbits of hyperhypersimple sets J. Symbolic Logic, 49, № 1, 51-62 85.01.58 OS article Вернуться к поиску

Maass W. [1981] Recursively invariant β-recursion theory Ann. Math. Logic, 21, № 1, 21-73 82.05.39 article Вернуться к поиску

Maass W. [1985] Variations on promptly simple sets J. Symbolic Logic, 50, № 1, 138-148 86.02.56 OS article Вернуться к поиску

Maass W., Slaman T.A. [1992] The complexity types of computable sets J. Comp. and Syst. Sci., 44, № 2, 168-192 ? article Вернуться к поиску

Maass W. [1978] The uniform regular set theorem in α-recursion theory J. Symbolic Logic, 43, № 2, 270-279 79.03.39 article Вернуться к поиску

Maass W. [1978] Inadmissibility, tame recursively enumerable sets and the admissible collapse Ann. Math. Logic, 13, № 2, 149-170 78.10.29 article Вернуться к поиску

Maass W., Shore R.A., Stob M. [1981] Splitting properties and jump classes Israel. J. Math., 39, № 3, 210-224 82.06.55 OS article Вернуться к поиску

Maass W. [1978] High α-recursively enumerable degrees General Recursion Theory, II, Proc. Symp. (Oslo, 1977), 239-269 North Holland 79.08.38 O article Вернуться к поиску

Maass W. [1981] A countable basis for Σ 2 1 sets and recursion theory on ℵ 1 Proc. Amer. Math. Soc., 82, № 2, 267-270 81.01.40 S article Вернуться к поиску

Maass W. [1977] On minimal pairs and minimal degrees in higher recursion theory Arch. Math. Logik Grundl., 18, № 3/4, 169-186 78.06.65 article Вернуться к поиску

Maass W., Slaman T.A. [1989] Extensional properties of sets of time bounded complexity Lect. Notes in Comp. Sci., 380, 318-326, Springer -Verlag ? article Вернуться к поиску

Dietzfelbinger M., Maass W. [1985] Strong reducibilities in α- and β-recursion theory Lect. Notes in Math., 1141, 89-120, Springer-Verlag 86.03.47 article Вернуться к поиску

Homer S., Maass W. [1983] Oracle dependent properties of the lattice of NP sets. Theor. Comput. Sci., 24, № 3, 279-289 83.12.700 OS article Вернуться к поиску

Maass W., Slaman T.A. [1989] Some problems and results in the theory of actually compuable functions Logic Coll’88, North-Holland, 79-89 90.07.29 article Вернуться к поиску

Maass W. [1978] Fine structure theory of the constructible universe in α- and β-recursion theory Lect. Notes in Math., 669, 339-359, Springer-Verlag 79.07.66 article Вернуться к поиску

Maass W. [1986] Are recursion theoretic arguments useful in complexity theory ? Proc. VII Inter. Congress Logic, Methdology Philosophy Sci., (Salzburg, 1983), North-Holland, 141-158 87.02.34 S article Вернуться к поиску

Maass W., Slaman T.A. [1990] On the relationship between the complexity, the degree and the extension of a computable set Lect. Notes in Math., 1432, 297-322, Springer-Verlag ? article Вернуться к поиску

Maass W. [1983] Characterization of recursively enumerable sets with supersets effectively isomorphic to all recursively enumerable sets Trans. Amer. Math. Soc., 279, № 1, 311-336 84.04.56 OS article Вернуться к поиску

Maass W., Stob M. [1983] The intervals of the lattice of recursively enumerable sets determined by major subsets Ann. Pure Appl. Logic, 24, № 2, 189-212 84.03.83 OS article Вернуться к поиску

Maass W. [1985] Major subsets and automorphisms of recursively enumerable sets Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 21-32 86.03.57 OS article Вернуться к поиску

Maass W., Slaman T.A. [1992] Splitting and density for the recursive sets of a fixed time complexity Proc. Conf. “Logic from computer science”, (Berceley, 1989), Math. Sci. Res. st. Publ., 21, 359-372, Springer. 93.ВН7.112 article Вернуться к ...

Shoenfield J.R. [1967] Mathematical Logic Addison Wesley, Reading, Maass (Имеется русский перевод.) ? S book Вернуться к поиску

M Maass W. Mac Queen D. Machover M. Machtey M. MacintyreA MacIntyreJM Madan D.B. Mahaney S.R. Mahn F.K. Maier W. Mainhardt G. Maksimova L. L. Malcev A.I. Manasse M. Manaster A. B. Marandzjan G. B. Marcone A. Marker D. Marques I. MartinDA MartinG Matiyasevich ...