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

Groszek M.J., Mytilinaios M.E., Slaman T.A. [1996] The Sacks density theorem and Σ 2 -bounding J. Symbolic Logic, 61, № 2, 450-467 01.10.123 O article Вернуться к поиску

Coles R. J., Downey R. G., Slaman T.A. [2000] Every set has a least jump enumeration J. London Math. Soc., 62, № 3, 641-649 05.09.73 article Вернуться к поиску

Slaman T.A., Sorbi A. [1998] Quasi-minimal enumeration degrees and minimal Turing degrees Ann. mat. pure ed appl., 174, № 4, 79-88 02.06.60 article Вернуться к поиску

Slaman T.A., Woodin H.W. [1998] Extending partial orders to dense linear orders Ann. Pure Appl. Logic, 94, № 1-3, 253-261 00.09.54 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 Вернуться к поиску

Mytilinaios M.E., Slaman T.A. [1996] On a question of Brown and Simpson London Math. Soc. Lect. Notes, Cambridge Univ. Press, Cambridge, 224, 205-218 ? article Вернуться к поиску

Shore R.A., Slaman T.A. [2006] The ∀∃ theory of D ( / ) is undecidable Lect. Notes in Logic, 24, 326-344, ASL La Jolla, Cal. ? article Вернуться к поиску

Cooper S.B., Slaman T.A., Wainer S.S. [1996] Appendix: questions in recursive theory London Math. Soc. Lect. Notes, Cambridge Univ. Press, 224, 333-347 ? article Вернуться к поиску

Slaman T.A. [1991] The density of infima in the recursively enumerable degrees Ann. Pure Appl. Logic, 52, № 1-2, 155-179 91.12.33 OS article Вернуться к поиску

Slaman T.A., Woodin H.W. [1989] Σ 1 - collection and the finite injury priority method Lect. Notes in Math., 1388, 178-188, Springer-Verlag 90.12.61 O article Вернуться к поиску

Khoussainov B. M., Lempp S., Slaman T.A. [2005] Computably enumerable algebras, their expansions, and isomorphisms Inter. J. Algeb. and Comp., 15, № 3, 437-454 06.12.299 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 Вернуться к поиску

Groszek M.J., Slaman T.A. [1983] Independence results on the global structure of the Turing degrees Trans. Amer. Math. Soc., 277 , № 2, 579-588 83.12.49 O article Вернуться к поиску

Shinoda J., Slaman T.A. [1990] On the theory of the PTIME degrees of the recursive sets J. Comp. and System Sci., 41, № 3, 321-366 91.Г4.493 O article Вернуться к поиску

Jockusch C.G. Jr., Slaman T.A. [1993] On the Σ 2 -theory of the upper semilattice of Turing degrees J. Symbolic Logic, 58, № 1, 193-204 94.01.40 article Вернуться к поиску

Nies A., Shore R.A., Slaman T.A. [1998] Interpretability and definability in the recursively enumerable degrees Proc. London Math. Soc., 77, № 2, 241-291 01.11.65 OS 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 Вернуться к поиску

Lempp S., Nies A., Slaman T.A. [1998] The Π 3 -theory of the c. e.Turing degrees is undecidable Trans. Amer. Math. Soc., 350, № 7, 2719-2736 01.11.66 OS article Вернуться к поиску

Cholak P., Jockusch C.G. Jr., Slaman T.A. [2001] On the strength of Ramsey’s theorem for pairs J. Symbolic Logic, 66, № 1, 1-55; corr. 74, № 4, 1438-1439 03.11.96 article Вернуться к поиску

Cholak P., Downey R. G., Fortnow L. Gasarch W. I., Kinber E. B,, Kummer M., Kurtz S. A., Slaman T.A. [1992] Degrees of Inferability Proc. V Ann. Conf. Comp. Learning Theory, 180-192 ? article Вернуться к поиску

Slaman T.A. [1985] The E - recursively enumerable degrees are dense Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 195-213 86.03.44 article Вернуться к поиску

Shore R.A., Slaman T.A. [1992] The p-T -degrees of the recursive sets: lattice embedding, extension of embeddings and two quantifier theory Theor. Comput. Sci., 97, № 2, 263-284 93.ВН7.100 O article Вернуться к поиску

Chong C.T., Qian Lei. Slaman T.A., Yang Yue [2001] Σ 2 -induction and infinite injury priority arguments, III, Prompt sets, minimal pairs and Shoenfield’s conjecture Israel J. Math., 1 21, № 1, 1-28 ? article Вернуться к поиску

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

Lempp S., Slaman T. [2007] The complexity of the index sets of ℵ 0 -categorical theories and of Ehrenfeucht theories Advances in logic (North Texas logic conf.), Providence RI: Amer. Math. Soc., 43-47 09.06.97 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 Вернуться к поиску

Hirschfeldt D. R., Kjos-Hanssen B., Jockusch C.G. Jr., Lempp S., Slaman T.A. [2008] The strength of some combinatorial principles related to Ramsey’s theorem for pairs Proc. IMS Workshop “Computational Prospects of Infinity”, (Singapore, 2005), Lect. Notes Series, 15, Institute Math. Sci., Nat. Univ. Singapore, 143-162 ...

Leonhardi S.D. [1996] . Nonbounding and Slaman triples Ann. Pure Appl. Logic, 79, № 2, 139-163 01.01.116 article Вернуться к поиску

... V.L. Selman A.L. Semenov A.L. Semukhin P. Shapiro N. Shavrukov V. Yu. Shelach S. Shen A.Kh. Shepherdson J.C. Shi Nian Dong Shinoda J. Shlapentokh A. Shoenfield J.R. Shore R.A. Silibovski S. Simon J. Simpson S.G. Skolem T. Skordev D. 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....