Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)



Finitely generated codings and the degrees r.e. in a degree $ {\bf d}$

Author: Richard A. Shore
Journal: Proc. Amer. Math. Soc. 84 (1982), 256-263
MSC: Primary 03D25; Secondary 03D30
MathSciNet review: 637179
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We introduce finitely generated (partial) lattices which can be used to code an arbitrary set $ D$. Results of Lerman, Shore and Soare are used to embed these lattices in the degrees r.e. in $ D$. Thus if the degrees r.e. in and above $ {\mathbf{d}}$ are isomorphic to those r.e. in and above $ {\mathbf{c}}$, $ {\mathbf{d}}$ and $ {\mathbf{c}}$ are of the same arithmetic degree. Similar applications are given to generic degrees and general homogeneity questions.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 03D25, 03D30

Retrieve articles in all journals with MSC: 03D25, 03D30

Additional Information

Keywords: Recursively enumerable degrees, homogeneity problems, generic degrees
Article copyright: © Copyright 1982 American Mathematical Society

American Mathematical Society