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

Csima B., Montalban A., Shore R.A. [2006] Boolean algebras, Tarski invariants and index sets Notre Dame J. Math. Logic, 47, № 1, 1-23 ? article Вернуться к поиску

Metakides G., Nerode A., Shore R.A. [1985] Recursive limits on the Hahn-Banach theorem Contemporary Math., 39, 85-91 86.Б3.1134 S article Вернуться к поиску

Downey R. G., Lempp S., Shore R. A. [1996] Jumps of minimal degrees below 0 / J. London Math. Soc., 53, № 3, 427-439 98.02.54 O article Вернуться к поиску

Downey R. G., LaForte G., Shore R. A. [2003] Decomposition and infima in the c.e. degrees J. Symbolic Logic, 68, № 2, 551-579 06.01.73 article Вернуться к поиску

Shore R.A. [1982] Finitely generated codings and the degrees r. e. in a degree d Proc. Amer. Math. Soc., 84, № 2, 256-263 82.10.42 OS article Вернуться к поиску

Shore R.A. [2002] Computability structures: presentations matter Proc. XI Inter. Congress Logic, Methodology, Philosophy Sci., (Cracow, 1999), Kluwer Acad. Publishers, v.1, 81-95 ? article Вернуться к поиску

Shore R.A. [1997] Conjectures and questions from G. Sacks “Degrees of Unsolvability” Arch. Math. Logik Grundl., 36, № 4-5, 233-253 01.11.64 O article Вернуться к поиску

Shore R.A. [1978] Some more minimal pairs of α-recursively enumerable degrees Z. math. Logik und Grundl. Math., 24, № 5, 409-418 79.06.60 article Вернуться к поиску

Shore R.A. [1980] Some constructions in α-recursion theory London Math. Soc. Lect. Notes, Cambridge Univ. Press, 45, 158-170 81.03.44 S article Вернуться к поиску

Shore R.A. [1978] Nowhere simple sets and the lattice of recursively enumerable sets J. Symbolic Logic, 43, № 2 , 322-330 79.02.50 SO article Вернуться к поиску

Fejer L., Shore R.A. [1990] A direct construction of a minimal recursively enumerable truth-table degree Lect. Notes in Math., 1432, 187-204, Springer-Verlag ? OS article Вернуться к поиску

Lerman M., Shore R.A. [1988] Decidability and invariant classes for degree structures Trans. Amer. Math. Soc., 310, № 2, 669-692 89.12.76 O article Вернуться к поиску

Downey R. G., Shore R. A. [1997] There is no degree invariant half-jump Proc. Amer. Math. Soc., 125, № 10, 3033-3037 01.11.71 O article Вернуться к поиску

Jockusch C.G. Jr., Shore R.A. [1983] Pseudo-jump operators I: the r. e. case Trans. Amer. Math. Soc., 275, № 2, 599-609 83.10.48 OS article Вернуться к поиску

Ambos-Spies K., Hirschfeldt D.R., Shore R.A. [2000] Undecidability and 1-types in intervals of the c. e. degrees Ann. Pure Appl. Logic, 106, № 1, 1-47 ? S article Вернуться к поиску

Goncharov S.S., Harizanov V.S., Knight J.F., Shore R.A. [2004] Π 1 1 relations and paths through 0 J. Symbolic Logic, 69, № 2, 585-611 05.09.95 article Вернуться к поиску

Fejer L., Shore R.A. [2001] Every incomplete computably enumerable truth-table degree is branching Arch. Math. Logik Grundl., 40, № 2, 113-123 04.12.86 O 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 Вернуться к поиску

Abraham U., Shore R.A. [1986] Initial segments of the Turing degrees of size ℵ 1 Israel J. Math., 53, № 1, 1-51 86.12.68 OS article Вернуться к поиску

Shore R.A. [1982] On homogeneity and definability in the first-order theory of the Turing degrees J. Symbolic Logic, 47, № 1, 8-16 82.10.41 OS article Вернуться к поиску

Shore R.A., Yang Yue [2002] A nonlow 2 r. e. degree with the extension of embeddings properties of a low 2 degree Math. Logic Quarterly, 48, № 1, 131-146 ? article Вернуться к поиску

Arslanov M.M., Lempp S., Shore R. A. [1996] Interpolating d -r.e. and REA degrees between r.e. degrees Ann. Pure Appl. Logic, 78, № 1, 29-56 97.ВН6.62 O article Вернуться к поиску

Arslanov M.M., Lempp S., Shore R. A. [1996] On isolating r.e. and isolated d -r.e. degrees London Math. Soc. Lect. Notes, Cambridge Univ. Press, 224, 61-80 ? O article Вернуться к поиску

Cholak P., Goncharov S.S., Khoussainov B. M., Shore R. A. [1999] Computable categorical structures and expansions by constants J. Symbolic Logic, 64, № 1, 13-37 01.05.98 article Вернуться к поиску

Nerode A., Shore R. A. [1980] Second-order logic and first-order theories of reducibility orderings Proc. “The Kleene Symposium”, (Madison, Wisconsin, USA, 1979), North-Holland, 181-200 ? OS article Вернуться к поиску

Nerode A., Shore R.A. (eds) [1985] Recursive Theory Proc. Summer Institute on Recursive Theory (Ithaca, New York), Amer. Math. Soc., Ass. Symbolic Logic ? book Вернуться к поиску

Haught C. A., Shore R. A. [1990] Undecidability and initial segments of the wtt -degrees below Lect. Notes in Math., 1432, 223-224, Springer-Verlag 91.04.70 O article Вернуться к поиску

Jockusch C.G. Jr., Shore R.A. [1984] Pseudo-jump operators, II : transfinite iterations, hierarchies and minimal covers J. Symbolic Logic, 49, № 4, 1205-1236 85.09.32 OS article Вернуться к поиску

Buss S., Kechris A. S., Pillay A., Shore R. A. [2001] Prospects for mathematical logic in the twenty-first century Bull. Symbolic Logic, 7, № 2, 169-196 03.10.77 article Вернуться к поиску

Cenzer D., Downey R. G., Jockusch C.G. Jr., Shore R. A. [1993] Countable thin Π 1 0 classes Ann. Pure Appl. Logic, 59, № 2, 79-139 93.09.20 article Вернуться к поиску

Shore R.A. [1984] The arithmetical degrees are not elementarily equivalent to the Turing degrees Arch. Math. Logik Grundl., 24, № 3-4 , 137-139 85.07.69 OS article Вернуться к поиску

Nies A., Shore R.A. [1995] Interpreting true arithmetic in the theory of the r. e. truth table degrees Ann. Pure Appl. Logic, 75, № 3, 269-311 96.ВН4.16 O article Вернуться к поиску

Miller R. G., Nies A, Shore R. A. [2004] Undecidability of the ∀∃-theory of R ( ≤ , ∨ , ∧ ) Trans. Amer. Math. Soc., 356, № 8, 3025-3067 08.01.204 article Вернуться к поиску

Lerman M., Shore R.A., Soare R.I. [1984] The elementary theory of the recursively enumerable degrees is not ℵ 0 -categorical, Adv. in Math., 53, № 3, 301-320 ? OS 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 Вернуться к поиску

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

Hirschfeldt D. R., Khoussainov B. M., Shore R. A. [2003] Computably categorical structure whose expansion by a constant has infinite computable dimension J. Symbolic Logic, 68, № 4, 1199-1241 05.05.107 article Вернуться к поиску

Shore R.A. [1978] On the ∀∃ sentences of α-recursion theory General Recursion Theory, II, Proc. Symp. (Oslo, 1977), 331-354, North Holland 79.08.35 OS article Вернуться к поиску

Shore R.A. [1977] α-recursion theory Handbook of Mathematic Logic, p.D, North-Holland, 653-680 (Русский перевод в Справочной книге по математической логике, ч. III , (Ершов Ю. Л. – ред.), ...

Hirschfeldt D. R., Khoussainov B. M., Shore R. A. Slinko A. [2002] Degree spectrs and computable dimension in algebraic structures Ann. Pure Appl. Logic, 115, № 1-3, 71-113 08.01.215 article Вернуться к поиску

Shore R.A. [2008] Rigidity and biinterpretability in the hyperdegrees Proc. IMS Workshop "Computational Prospects of Infinity", (Singapore, 2005), Lect. Notes Series, 15, Institute Math. Sci., Nat. Univ. Singapore, 299-312 ? article Вернуться ...

Shore R.A. [1984] The degrees of unsolvability: the ordering of functions by relative computability Proc. Inter. Congress of Mathematicians, (Warsaw, 1983), PWN-Polish Sci. Publishers, Warsaw, 337-345 86.09.41 S 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 Вернуться к поиску

Fejer L., Shore R.A. [1985] Embeddings and extensions of embeddings in the recursively enumerable tt - and wtt -degrees Lect. Notes in Math., 1141, 121-140, Springer-Verlag 86.04.45 OS 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 Вернуться к поиску

Shore R.A. [1985] The structure of the degrees of unsolvability Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 33-51 86.02.48 S article Вернуться к поиску

Shore R.A. [1982] The theories of the truth-table and Turing degrees are not elementarily equivalent Proc. Logic Coll.’80, ( European Summer Meet. of Ass. Symb.Logic, planed for Prague, 1982), North-Holland, 231-237 ? OS article Вернуться к поиску

Jockusch C.G. Jr., Shore R.A. [1985] REA operators, RE degrees and minimal covers Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 3-111 86.03.54 OS article Вернуться к поиску

Shore R.A. [1993] The theories of the T , tt and wtt r.e. degrees: undecidability and beyond Proc IX Latin. Amer. Symp. Math. Logic (Bahia Blanca, Argentina, 1992), Notas de Lo’gica Math, 38, Univ. Nac. del Sur, 61-70 95.11.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. OS article Вернуться ...