No Access

ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE -SETS

STEFFEN LEMPP

Department of Mathematics, University of Wisconsin, Madison, WI 53706-1388, USA

Search for more papers by this author

THEODORE A. SLAMAN

Department of Mathematics, University of California, Berkeley, CA 94720-3840, USA

Search for more papers by this author

, and

ANDREA SORBI

Dipartimento di Scienze Matematiche e Informatiche "Roberto Magari", Università di Siena, I-53100 Siena, Italy

Search for more papers by this author

https://doi.org/10.1142/S0219061305000432Cited by:8 (Source: Crossref)

Abstract

We give an algorithm for deciding whether an embedding of a finite partial order into the enumeration degrees of the -sets can always be extended to an embedding of a finite partial order .

Keywords:

AMSC: 03D30

References

S. Ahmad and A. H. Lachlan, Math. Log. Quart. 44, 431 (1998). Crossref, Web of Science, Google Scholar
K. Ambos-Spies, On the structure of the recursively enumerable degrees, Doctoral dissertation, University of Munich, Germany (1980) . Google Scholar
C. J. Ashet al., Ann. Pure Appl. Log. 42, 195 (1989). Crossref, Web of Science, Google Scholar
S. B. Cooper, J. Symb. Log. 49, 503 (1984). Crossref, Web of Science, Google Scholar
S. B. Cooperet al., Ann. Pure Appl. Log. 55, 125 (1991). Crossref, Web of Science, Google Scholar
R. G. Downey, Recursion Theory Week (Oberwolfach, 1989), Lecture Notes in Mathematics, No. 1432, eds. K. Ambos-Spieset al. (Springer-Verlag, 1990) pp. 111–140. Crossref, Google Scholar
P. A. Fejer and R. A. Shore, Recursion Theory Week, eds. H.-D. Ebbinghaus, G. Müller and G. E. Sacks (Springer-Verlag, Heidelberg, 1985) pp. 121–140. Crossref, Google Scholar
G. Higman and E. Scott , Existentially Closed Groups , London Mathematical Society Monographs ( Oxford University Press , Oxford , 1988 ) . Google Scholar
A. H. Lachlan and R. A. Shore, Arch. Math. Log. 31, 277 (1992). Crossref, Google Scholar
S. Lempp and A. Sorbi, J. Symb. Log. 67, 67 (2002). Google Scholar
M. Lerman and R. A. Shore, Trans. Amer. Math. Soc. 310, 669 (1988). Crossref, Web of Science, Google Scholar
K. McEvoy and S. B. Cooper, J. Symb. Log. 50, 983 (1985). Crossref, Web of Science, Google Scholar
H. Rogers Jr. , Theory of Recursive Functions and Effective Computability ( McGraw-Hill , New York, Toronto, London , 1967 ) . Google Scholar
G. E. Sacks, Ann. Math. (2) 80, 300 (1964). Crossref, Web of Science, Google Scholar
T. A. Slaman and R. I. Soare, Ann. Math. 153, 1 (2001). Web of Science, Google Scholar
T. A. Slaman and R. I. Soare, Extension of embeddings in the computably enumerable degrees — Erratum . Google Scholar
T. A. Slaman and W. H. Woodin, Arch. Math. Log. 36, 255 (1997). Crossref, Web of Science, Google Scholar
R. I. Soare , Recursively Enumerable Sets and Degrees , Perspectives in Mathematical Logic ( Springer-Verlag , Berlin, New York , 1987 ) . Crossref, Google Scholar
S. K. Thomason, Z. Math. Log. Grundlagen Math. 17, 273 (1971). Crossref, Google Scholar