Pairs without infimum in the recursively enumerable weak truth table degrees
From MaRDI portal
Publication:3714068
DOI10.2307/2273948zbMath0587.03030OpenAlexW2168011248MaRDI QIDQ3714068
Publication date: 1986
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273948
latticesdegrees of unsolvabilityinitial segmentswtt-reducibilitywtt-degreerecursive bound on the oracle informationweak reducibilities
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Structural interactions of the recursively enumerable T- and W-degrees ⋮ Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding ⋮ Infima in the recursively enumerable weak truth table degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities