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

Sorbi A. [1991] Embedding Brouwer algebras in the Medvedev lattice Notre Dame J. Formal Logic, 32, № 2, 266-275 ? article Вернуться к поиску

Sorbi A. [1990]] On some filters and ideals of the Medvedev lattice Arch.Math. Logic, 30, 29-48 ? article Вернуться к поиску

Sorbi A. [1982] Numerazioni positive r.e. classi e formule Boll. Unione mat. ital., D1, № 1, 403-411 85.05.61 article Вернуться к поиску

Sorbi A. [2000] Open problems in the enumeration degrees Contemporary Math., 257, 309-320 01.ВН12.68 article Вернуться к поиску

Sorbi A. [1982] Σ n 0 -equivalence relations Stud. Logica, 41, № 4, 351-358 85.01.63 article Вернуться к поиску

Kent T.F., Sorbi A. [2007] Bounding nonsplitting enumeration degrees J. Symbolic Logic, 72, № 4, 1405-1417 ? article Вернуться к поиску

Bernardi C., Sorbi A. [1983] Classifying positive equivalence relations J. Symbolic Logic, 48, № 3, 529-538 84.05.72 article Вернуться к поиску

Nies A., Sorbi A. [1999] Branching in the Σ 2 enumeration degrees Israel J.  Math., 110, № 1, 29-59 ? O article Вернуться к поиску

Omanadze R.Sh.,Sorbi A. [2006] Strong enumeration reducibilities Arch. Math. Logik Grundl., 45, 7, 869-912 ? article Вернуться к поиску

Omanadze R.Sh.,Sorbi A. [2008] A characterization of the Δ 2 0 hyperhyperimmune sets J. Symbolic Logic, 73, 4, 1407-1415 ? article Вернуться к поиску

Omanadze R.Sh.,Sorbi A. [2010] Immunity properties of the s -degrees Georgian Math. Jour., 17, № 3, 563-579 ? article Вернуться к поиску

Cooper S.B., Sorbi A., Yang Yue ? A capping theorem for the Δ 2 0 enumeration degrees ? ? article Вернуться к поиску

Sorbi A. [1988] On quasi-minimal e - degrees and total e -degrees Proc. Amer. Math. Soc., 102, № 4, 1005-1008 89.02.40 article Вернуться к поиску

Nies A., Sorbi A. [2000] Structural properties and Σ 2 0 enumeration degrees J. Symbolic Logic, 65, №.1, 285-292 05.08.88 O article Вернуться к поиску

Cooper S.B., Sorbi A. [1996] Noncappable enumeration degrees below 0 e / J. Symbolic Logic, 61, № 4, 1347-1363 98.02.50 01.01.117 O article Вернуться к поиску

Lempp S., Slaman T.A., Sorbi A. [2005] On extensions of embeddings into the Σ 2 0 -enumeration degrees J. Math. Logic, 5, № 2, 247-298 ? article Вернуться к поиску

Sorbi A. [1990] Some remarks on the algebraic structure of the Medvedev lattice J. Symbolic Logic, 55, № 2, 831-853 91.09.284 article Вернуться к поиску

Sorbi A. [1998] Sets of generators and automorphism bases for the enumeration degrees Ann. Pure Appl. Logic, 94, № 1-3, 263-272 ? O article Вернуться к поиску

Sorbi A. [1996] The Medvedev lattice of degrees of difficulty London Math. Soc. Lect. Notes, Cambridge Univ. Press, 224, 289-312 ? article Вернуться к поиску

Bianchini C.,Sorbi A. [1996] A note on closed degrees of difficulty of the Medvedev lattice Math. Logic Quarterly, 42, № 1,127-133 ? article Вернуться к поиску

Sorbi A. (ed.) [1997] Complexity, Logic, and Recursion Theory Lect. Notes in Pure and Appl. Math., 187, Marcel Dekker, N.Y ? book Вернуться к поиску

Bianchini C., Sorbi A. [1992 Reducibilities in some recursion categories of partial recursive operators Z. Math. Logik Grundlag. Math., 38, № 4, 349-359 ? article Вернуться к поиску

Lempp S., Sorbi A. [2002] Embedding finite lattice into the Σ 2 0 - enumeration degrees J. Symbolic Logic, 67, № 1, 69-90 03.04.206 O article Вернуться к поиску

Arslanov M.M., Sorbi A. [1999] Relative splitting of 0 / e in Δ 2 0 -enumeration degrees Lect. Notes in Logic, 13, 44-56, Springer -Verlag ? article Вернуться к поиску

Bereznyuk S., Coles R. J., Sorbi A. [2000] The distribution of properly Σ 2 0 e -degrees J. Symbolic Logic, 65, № 1, 19-32 05.08.89 article Вернуться к поиску

Montagna F., Sorbi A. [1985] Universal recursion theoretic properties of recursively enumerable preordered structures J. Symbolic Logic, 50, № 2, 397-406 86.01.58 G article Вернуться к поиску

Cooper S.B., Li A., Sorbi A., Yang Yue [2003] There exists a maximal 3-c.e. enumeration degree Israel J. Math., 137, 285-320 ? article Вернуться к поиску

Sorbi A. [1997] The enumeration degrees of the Σ 2 0 sets Complexity, Logic and Recursion Theory, Lecture Notes Pure and Applied Mathematics, 303-330 ?; O article Вернуться к поиску

Sorbi A. [1991] Some quotient lattices of the Medvedev lattice Z. Math. Logik Grundlag. Math., 37:167-182 92.09.276; 92.Г9.29 article Вернуться к поиску

Montagna F., Sorbi A. [1989] Creativeness and completeness in recursion categories of partial recursive operators J. Symbolic Logic, 54, № 3, 1023-1041 90.11.41 G 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 Вернуться к поиску

Giorgi M.B., Sorbi A., Yang Yue [2006] Properly Σ 2 0 enumeration degrees and the high/low hierarchy J. Symbolic Logic, 71, № 4, 1125-1144 ? article Вернуться к поиску

Sorbi A. [1991] Comparing Π 2 0 sets of the Baire space by means of general recursive operators Fund. math., 138, № 1, 1-12 92.08.51 article Вернуться к поиску

Arslanov M. M., Kalimullin I. Sh., Sorbi A. [2001] Density results in the Δ 2 0 - e -degrees Arch. Math. Logik Grundl., 40, № 8, 597-614 04.12.87 article Вернуться к поиску

Cooper S.B., Li A. Sorbi A., Yang Yue [2005] Bounding and non bounding minimal pairs in the enumerable degrees J. Symbolic Logic, 70, № 3, 741-766 ? article Вернуться к поиску

Badaev S.A., Goncharov S.S., Sorbi A. [2003] Completeness and universality of arithmetical numberings Computability and models: perspectives East and West Kluwer Academic/Plenum Publishers, 11-44. ? article Вернуться к поиску

Badaev S.A., Goncharov S.S., Sorbi A. [2005] On elementary theories and isomorphism types of Rogers semilattices Theory of models, Almaty, Kazachstan, ECO Studio, 277-301 09.12.127 article Вернуться к поиску

Cooper S.B., Sorbi A., Yi Xiaoding [1996] Cupping and noncupping in the enumeration degrees of Σ 2 0 sets Ann. Pure Appl. Logic, 82, № 3, 317-342 01.10.26 O article Вернуться к поиску

Badaev S.A., Goncharov S.S., Sorbi A. [2003] Elementary properties of Rogers semilattices of arithmetical numberings Proc. 7-8 Asian Logic Conf., (Singapore, 2002), 1-10, World Scientific, Singapore Univ. Press ? article Вернуться к поиску

Shore R.A., Sorbi A. [1999] Jumps of Σ 2 high e -degrees and properly Σ 2 e -degrees Recursion Theory and Complexity, de Gruyter Series in Logic and Its Applications 2, de Grueter, 157-172 ? article Вернуться к поиску

Badaev S.A., Goncharov S.S., Sorbi A. [2003] Isomorhism types and theories of Rogers semilattices of arithmetical numberings Computability and models: perspectives East and West Kluwer Academic/Plenum Publishers, 79-91 ? article Вернуться к поиску

Sorbi A. [2002] Embeddings into the enumeration degrees Proc. Inter. Conf. “Logic and Its Apll.”, devoted to Yu. Ershov and A.I. Mal’cev, (Novosibirsk, 2002), Novosibirsk, NSU, 144-164 05.11.116 article Вернуться к поиску

Badaev S.A., Goncharov S.S. Podzorov S.Yu. Sorbi A. [2003] Algebraic properties of Rogers semilattices of arithmetical numberings Computability and models: perspectives East and West Kluwer Academic/Plenum Publishers, 45-77 ? article Вернуться к поиску

... 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. Stewart F.M. Steyaert J.M. Stillwell J. Stob M. Stockmeyer L.J. Stoltenberg-Hansen V. StrongHR Sturgis H. E. Su Kaile ...