Wtt-degrees and T-degrees of r.e. sets

DOI10.2307/2273658zbMath0563.03028OpenAlexW2025135609MaRDI QIDQ3676135

Michael Stob

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

latticeTuring degrees

Mathematics Subject Classification ID

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

Related Items (19)

Structural interactions of the recursively enumerable T- and W-degrees ⋮ Maximal contiguous degrees ⋮ Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Classification of degree classes associated with r.e. subspaces ⋮ On the problem of the critical bound ⋮ Splitting properties of r.e. sets and degrees ⋮ The discontinuity of splitting in the recursively enumerable degrees ⋮ An extended Lachlan splitting theorem ⋮ Cupping and noncapping in the r.e. weak truth table and turing degrees ⋮ Infima in the recursively enumerable weak truth table degrees ⋮ Localization of a theorem of Ambos-Spies and the strong anti-splitting property ⋮ Some results about the R.E. degrees ⋮ There Are No Maximal d.c.e. wtt-degrees ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ Continuity of capping in \(\mathcal C_{\text{bT}}\) ⋮ Embeddings of \(N_5\) and the contiguous degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ The recursively enumerable degrees have infinitely many one-types ⋮ The contiguity in R/M.

Cites Work

• Unnamed Item
• The undecidability of the recursively enumerable degrees
• The weak truth table degrees of recursively enumerable sets
• Degrees in Which the Recursive Sets are Uniformly Recursive

This page was built for publication: Wtt-degrees and T-degrees of r.e. sets