The jump is definable in the structure of the degrees of unsolvabilityCOOPER, S. B.Bulletin, new series, of the American Mathematical Society. 1990, Vol 23, Num 1, pp 151-158, issn 0273-0979, 8 p.Article

The limits of E-recursive enumerabilitySACKS, G. E.Annals of pure and applied logic. 1986, Vol 31, Num 1, pp 87-120, issn 0168-0072Article

Some properties of invariant setsBYERLY, R. E.The Journal of symbolic logic. 1984, Vol 49, Num 1, pp 9-21, issn 0022-4812Article

The intervals of the lattice of recursively enumerable sets determined by major subsetsMAASS, W; STOB, M.Annals of pure and applied logic. 1983, Vol 24, Num 2, pp 189-212, issn 0168-0072Article

Effectively nowhere simple setsMILLER, D; REMMEL, J. B.The Journal of symbolic logic. 1984, Vol 49, Num 1, pp 129-136, issn 0022-4812Article

Intersections of algebraically closed fieldsASH, C. J; ROSENTHAL, J. W.Annals of pure and applied logic. 1986, Vol 30, Num 2, pp 103-119, issn 0168-0072Article

Definability of r. e. sets in a class of recursion theoretic structuresBYERLY, R. E.The Journal of symbolic logic. 1983, Vol 48, Num 3, pp 662-669, issn 0022-4812Article

The universal splitting property. IILERMAN, M; REMMEL, J. B.The Journal of symbolic logic. 1984, Vol 49, Num 1, pp 137-150, issn 0022-4812Article

Characterization of recursively enumerable sets with supersets effectively isomorphic to all recursively enumerable setsMAASS, W.Transactions of the American Mathematical Society. 1983, Vol 279, Num 1, pp 311-336, issn 0002-9947Article

Wtt-degrees and t-degrees of r. e. setsSTOB, M.The Journal of symbolic logic. 1983, Vol 48, Num 4, pp 921-930, issn 0022-4812Article

Two theorems on truth table degreesDOWNEY, R. G.Proceedings of the American Mathematical Society. 1988, Vol 103, Num 1, pp 281-287, issn 0002-9939Article

Some undecidability results for lattices in recursion theoryCARROLL, J. S.Pacific journal of mathematics. 1986, Vol 122, Num 2, pp 319-331, issn 0030-8730Article

The leastα for which E (α) is inadmissibleHOOLE, M.R.R; ASH, C.J.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1986, Vol 41, Num 2, pp 143-151, issn 0334-3316Article

On the power of the splicing operationPAUN, G.International journal of computer mathematics. 1995, Vol 59, Num 1-2, pp 27-35, issn 0020-7160Article

THREE ASPECTS OF RECURSIVE ENUMERABILITY IN HIGHER TYPESSACKS GE.1980; LONDON MATH. SOC. LECTURE NOTE SER.; GBR; DA. 1980; NO 45; PP. 184-214; BIBL. 24 REF.Conference Paper

NUMERATIONS UNIVOQUES CALCULABLESGONCHAROV SS.1980; ALGEBRA LOG.; ISSN 0373-9252; SUN; DA. 1980; VOL. 19; NO 5; PP. 507-551; BIBL. 10 REF.Article

Effective model theory vs. recursive model theoryCHISHOLM, J.The Journal of symbolic logic. 1990, Vol 55, Num 3, pp 1168-1191, issn 0022-4812, 24 p.Article

TROIS THEOREMES SUR LES (TT)-DEGRESDEGTEV AN.1978; ALGEBRA I LOGIKA; SUN; DA. 1978; VOL. 17; NO 3; PP. 270-281; BIBL. 9 REF.Article

DEGRES FAIBLEMENT ET RECURSIVEMENT ENUMERABLES ET CALCULABILITE LIMITEARSLANOV MM.1979; VEROJATN. METODY KIBERN.; SUN; DA. 1979; NO 15; PP. 3-9; BIBL. 6 REF.Article

A note on direct sums of FriedbergnumberingsKUMMER, M.The Journal of symbolic logic. 1989, Vol 54, Num 3, pp 1009-1010, issn 0022-4812Article

Complementation in the Turing degreesSLAMAN, T. A; STEEL, J. R.The Journal of symbolic logic. 1989, Vol 54, Num 1, pp 160-176, issn 0022-4812Article

Litteral shuffleBERARD, B.Theoretical computer science. 1987, Vol 51, Num 3, pp 281-299, issn 0304-3975Article

Subsets of hypersimple setsDOWNEY, R. G.Pacific journal of mathematics. 1987, Vol 127, Num 2, pp 299-319, issn 0030-8730Article

Morphisms and partitions of V-setsSTATMAN, R.Lecture notes in computer science. 1999, pp 313-322, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Infima of recursively enumerable truth table degreesFEJER, P. A; SHORE, R. A.Notre Dame journal of formal logic. 1988, Vol 29, Num 3, pp 420-437, issn 0029-4527Article