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

Ambos-Spies K., Yang Dong Ping [1995] Some methods used in the research of structural polynomial complexity Adv. Math., (China), 24, 289-298 ? article Вернуться к поиску

Ambos-Spies K., Homer S., Yang Dong Ping [1990] Honest polynomial reductions and exptalli sets Lect. Notes in Math.,1432, 1-22, Springer-Verlag ? O article Вернуться к поиску

Ambos-Spies K., Terwijn S.A., Zheng Xizhong [1994] Resource bounded randomness and weakly complete problems Lect. Notes in Comp. Sci, 834, 369-377, Springer-Verlag ? article Вернуться к поиску

Ambos-Spies K. Ding Decheng [1994] Discontinuity of cappings in the recursively enumerable degrees and strongly non branching degrees Math. Logic Quarterly, 40, 287-317 ? article Вернуться к поиску

Ambos-Spies K., Nies A. [1992] The theory of the polynomial many-one degrees of recursive sets is undecidable, Lect. Notes in Comp. Sci., 577, 209-210, Springer-Verlag ? O 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 Вернуться к поиску

Ambos-Spies K., Nies A., Shore R.A. [1992] The theory of the recursively enumerable weak truth-table degrees is undecidable J. Symbolic Logic, 57, № 3, 864-874 93.04.51 O 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 Вернуться к поиску

Ambos-Spies K. Ding Decheng, Fejer P.A. [1993] Embedding distribute lattice preserving 1 below a nonzero recursively enumerable Turing degree Progr. Comp. Sci. Appl. Logic, 12, 92-129 ? article Вернуться к поиску

Ambos-Spies K., Yang Dong Ping [1990] Honest polynomial time degrees of elementary recursive sets Lect. Notes in Comp. Sci, 440, 1-15, Springer-Verlag 92.Г7.101 O 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 Вернуться ...

Ambos-Spies K., Jockusch C.G. Jr., Shore R. A., Soare R. I. [1984] An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees Trans. Amer. Math. Soc., 281, № 1, 109-128 84.09....

Downey R. G. [1987] Localization of a theorem of Ambos-Spies and the strong antisplitting properly Arch. Math. Logik Grundl., 26, № 3-4 , 127-136 88.04.36 OS article Вернуться к поиску

A AbianS Abraham U. Ackermann W. Aczel P. Addison J.W. Adleman L.M. Afshari B. Ahmad S. Alfeld Ch. Allender E. W. Aloisio P. Alton D.A. Ambos-Spies K. Appel K.I. AptKR Arbib M.A. Arslanov M. M, AshCJ AsserG. Ausiello G. AxJ Axt P. Вернуться на главную страницу