Finitely Generated Codings and the Degrees R.E. in a Degree d

DOI10.2307/2043675zbMATH Open0498.03031OpenAlexW4247092801MaRDI QIDQ3962985FDOQ3962985

Authors: Richard A. Shore 

Publication date: 1982

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2043675

zbMATH Keywords

generic degreearithmetic degreerecursively enumerable degreefinitely generated partial lattice

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (8)

• Undecidability and 1-types in the recursively enumerable degrees
• Lattice representations for computability theory
• Embedding and coding below a 1-generic degree
• The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
• Turing computability: structural theory
• Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
• Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)

This page was built for publication: Finitely Generated Codings and the Degrees R.E. in a Degree d

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962985)