Search results

Hodes H. T. [1983] More about uniform upper bounds on ideals of Turing degrees J. Symbolic Logic, 48, № 2, 441-457 84.02.40 article Вернуться к поиску

Welch P. D. [2000] Eventually infinite time turing machine degrees: Infinite time decidable reals J. Symbolic Logic, 65, № 3, 1193–1203 07.01.76 article Вернуться к поиску

Cooper S.B. [1996] Discontinuous phenomena and Turing definability Proc. Inter. Conf. "Algebra and Analysis”, (Kazan, Russia, 1994), Walter de Gruyter, 41-55 ? article Вернуться к поиску

Hodes H. T. [1980] Jumping through the transfinite: the master code hierarchy of Turing degrees J. Symbolic Logic, 45, № 2, 204-220 81.01.37 article Вернуться к поиску

Shepherdson J.C. [1985] Algotithmic procedures, generalized Turing algorithms, and elementary Recursion Theory Harvey Fridman’s Res. Found. Math., Amsterdam, 285-308 87.Г1.39 O article Вернуться к поиску

Hodes H. T. [1983] A minimal upper bound on a sequence of Turing degrees which represents than sequence Pacif. J. Math., 108, № 1, 115-119 84.02.43 article Вернуться к поиску

Ambos-Spies K. [1985] Cupping and noncapping in the r.e.weak truth table and Turing degrees Arch. Math. Logik Grundl., 25, № 3-4, 109-126 ? OS article Вернуться к поиску

Hodes H. T. [1981] Upper bounds on locally countable admissible initial segments of a Turing degrees hierarchy J. Symbolic Logic, 46, № 4, 753-760 82.08.48 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 Вернуться к поиску

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

Nelson G.C. [1974] Many-one reducibility within the turing degrees of the hyperarithmetical sets H α ( x ) Trans. Amer. Math. Soc., 191, № 1, 1-44 75.03.90 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 Вернуться к поиску

Calhoun W., Lerman M. [2001] Embedding finite lattices into the ideals of computably enumerable Turing degrees J. Symbolic Logic, 66, № 4, 1791-1802 05.09.85 article Вернуться к поиску

Calvert W., Harizanov V. S., Shlapentokh A. [2007] Turing degrees of isomorphism types of algebraic objects J. London Math. Soc., 75, 2, 273-286 08.03.169 article Вернуться к поиску

Jockusch C.G. Jr., Soare R.I. [1994] Boolean algebras, Stone spaces and the iterated Turing jump J. Symbolic Logic, 59, № 4, 1121-1138. 96.04.210 G article Вернуться к поиску

Friedman Sy D. [1982] The Turing degrees and metadegrees have isomorphic cones Proc. Patras Logic Symp. (Patras, Greece, 1980), North-Holland, 145-157 84.02.39 article Вернуться к поиску

Lempp S. [1998] Decidability and undecidability in the enumerable Turing degrees Proc. 6 Asian Logic Conf. (Beijing , China, 1998), 151-161 World Scientific, Singapore Univ. Press ? article Вернуться к поиску

Jahn M.A. [1996] Σ 5 -completeness of index sets arising from the recursively enumerable Turing degrees Ann. Pure Appl. Logic, 79, № 2, 109-137 00.09.55 article Вернуться к поиску

Lempp S., Nies A. [1995] The unsolvability of the Π 4 -theory for the r. e. wtt - and Turing degrees J. Symbolic Logic, 60, № 4, 1118-1136 01.10.27 O 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 Вернуться к поиску

Harizanov V. S. [1993] The possible Turing degree of the nonzero member in a two element degree spectrum Ann. Pure Appl. Logic, 60, № 1, 1-30 93.11.91 G 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 Вернуться к поиску

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

Minsky M.L. [1961] Recursive unsolvability of Post’s problem of “Tag” and other topics in theory of Turing machines Ann. Math., 74, № 3, 437-455 63.01.74 OS article Вернуться к поиску

Lempp S., Lerman M. [1997] A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees Ann. Pure Appl. Logic, 87, № 2, 167-185 ? OS 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 Вернуться к поиску

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

Downey R. G., Lempp S. [1997], [2002] Contiguity and distributivity in the enumerable Turing degrees J. Symbolic Logic, 62, № 4, 1215-1240; corr. 67, № 4, 1579-1580 01.11.68 05.09.82 O article Вернуться к поиску

Cooper S.B. [2002] On the intensionality of Turing definitions Proc. Inter. Conf. “Logic and Its Appl.”, devoted to Yu. Ershov and A.I. Mal’cev, (Novosibirsk, 2002), Novosibirsk, NSU, 40-58 05.11.115 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 Вернуться к поиску

... enumerable sets and degrees" (Russian version). G – Goncharov S.S., Ershov Ju. L. "Constructive Models" (Russian version). 7. Type of the paper: either book or article. For example: Abraham U., Shore R.A. [1986] Initial segments of the Turing degrees Israel. J. Math., 53, № 1, 1-51 86.12.68 REOSG article/book To find the papers containing certain words in the name or authored by a certain author type the words or author’s name in the Search box and click "Искать" button. The author wants to thank M.N. Grinev and A.G. Ryzhov for their help in creating the database. Search query syntax A common search query is one or more words, for example: contact information This query will find pages containing both query words. Logical operators allow building ...