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

DOI10.2307/2043675zbMath0498.03031OpenAlexW4247092801MaRDI QIDQ3962985

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

recursively enumerable degreegeneric degreearithmetic 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)

Related Items (8)

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

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