Search results
News
General Theory of Computability
(bibliography)
by Lavrov I.A.
By Author Name:
English: A-B-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-Z
Русские: А-Б-В-Г-Д-Е-Ж-З-И-К-Л-М-Н-О-П-Р-С-Т-У-Ф-Х-Ц-Ч-Ш-Щ-Э-Ю-Я
Search
Stephan F. [2001] On the structure inside truth-table degrees J. Symbolic Logic, 66, № 2, 731-770 05.08.83 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kjos-Hanssen B. Stephan F. [2003] Lowness for the classes of Schnorr random sets SIAM J. Comput., 35, № 3, 647-657 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Nies A., Stephan F., Terwijn S. [2005] Randomness, relativization and Turing degrees J. Symbolic Logic, 70, № 2, 515-535 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hirschfeldt D. R., Nies A., Stephan F. [2007] Using random sets as oracles J. London Math. Soc., 7, № 3, 610-622 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ho K., Stephan F. [1999] Simple sets and strong reducibilities Forschungsberichte Math. Logic, 45, Math. Inst., Univ. Heidelberg ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kummer M., Stephan F. [1996] On the structure of degrees of inferability J. Comp. and System Sci., 52, № 2, 214-238 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ho K., Stephan F. [2004] Simple sets and Σ 3 ideals under m -reducibility Lect. Notes in Logic, 17, 89-99 , Springer -Verlag ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ho K., Stephan F. [2002] Classes bounded by complete sets Ann. Pure Appl. Logic, 116, № 1-3, 273-295 08.01.200 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kummer M., Stephan F. [1995] Recursive theoretic properties frequency computation and bounded queries Inform. Comput., 120, № 1, 59-77 96.ВН4.107 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Afshari B., Barmpalias G., Cooper S.B., Stephan F. [2007] Post’s program for the Erchov hierarchy J. Logic and Comp., 17, № 6, 1025-1040 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kummer M., Stephan F. [1993] Weak semirecursive sets and recursively enumerable ordering Ann. Pure Appl. Logic, 60, № 2, 133-150 94.05.79 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Figueira S., Nies A., Stephan F. [2008] Lowness properties and approximations of the jump Ann. Pure Appl. Logic, 152, № 1-3, 51-66 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jockusch C.G. Jr., Stephan F. [1993] A cohesive set which is not high Math. Logic Quarterly, 39, 515-530; corr. 43, (1997), 569 ? S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ambos-Spies K., Bentzien L., Fejer P.A., Merkle W., Stephan F. [1998] Collapsing polynomial-time degrees Lect. Notes in Logic., 13, 1-24, Springer -Verlag ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ng Keng Meng , Stephan F., Wu G. [2006] The degree of weakly computable reals Lect Notes in Comput. Sci., 3988, 413-422 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Beigel R.J., Gasarch W.I., Kummer M., Martin G., McNicholl T., Stephan F. [2000] The complexity of Odd n A J. Symbolic Logic, 65, № 1, 1-18 01.09.55 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Fortnow L., Gasarch W. I., Jain S., Kinber E. B., Kummer M., Kurtz S. A., Pleszkoch M., Slaman T.A., Solovay R. M., Stephan F. [1994] Extremes in the degrees of inferability Ann. Pure Appl. Logic , 66, №.3, 231--276 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ambos-Spies K., Badaev S.A., Goncharov S.S. [2008] On a question of Frank Stephan Lect. Notes in Comp.Sci, 4978, 423-432, Springer -Verlag ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.... Skvortsova E.Z. Slaman T. A. Slinko A. Smith R.L. Smuga-Otto M. J. Smullyan R.M. Soare R. I. SolomonDR SolomonR Solon B. Solovay R.M. Sorbi A. SoskovIN SoskovaAA SoskovaMI Spector C. Sperschneider V. Spreen D. Stanley L. Stearns R.E. Steel J.R. Stefani S. Stephan F. Stephen B. Stewart F.M. Steyaert J.M. Stillwell J. Stob M. Stockmeyer L.J. Stoltenberg-Hansen V. StrongHR Sturgis H. E. Su Kaile Surányi J. Suzuki Y. Szmielew W. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.