Bounding minimal degrees by computably enumerable degrees

DOI10.2307/2586653MaRDI QIDQ4254684zbMATH OpenOpenAlexFDO

Authors Dongping Yang, Angsheng Li

Publication date 29 June 1999

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

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

zbMATH Keywords

bounding minimal degreescomputably enumerable degrees

Mathematics Subject Classification ID

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

Recommendations

• Minimal generalized computable enumerations and high degrees
• Bounding computably enumerable degrees in the Ershov hierarchy
• Bounded enumeration reducibility and its degree structure
• Bounding and nonbounding minimal pairs in the enumeration degrees
• Quasi-minimal enumeration degrees and minimal Turing degrees
• scientific article; zbMATH DE number 871851
• sQ₁-degrees of computably enumerable sets
• Bounded recursively enumerable sets and degrees
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Bounding nonsplitting enumeration degrees

Cites work

• A minimal degree less than 0’
• A theorem on minimal degrees
• Complementing below recursively enumerable degrees
• D.R.E. Degrees and the Nondiamond Theorem
• Degrees joining to 0′
• Degrees which do not bound minimal degrees
• Handbook of computability theory
• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 841082 (Why is no real title available?)
• Initial segments of degrees below 0′
• Initial segments of the degrees of unsolvability Part II: minimal degrees
• Minimal degrees of unsolvability and the full approximation construction
• Simple Proofs of Some Theorems on High Degrees of Unsolvability
• The jump is definable in the structure of the degrees of unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

Cited in

(11)

• The minimum degree of recursively representable choice functions
• sQ₁-degrees of computably enumerable sets
• Computably enumerable Turing degrees and the meet property
• 1-Generic Degrees Bounding Minimal Degrees Revisited
• Bounding non-GL₂ and R.E.A.
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Algebraic aspects of the computably enumerable degrees.
• scientific article; zbMATH DE number 2007859 (Why is no real title available?)
• scientific article; zbMATH DE number 5215800 (Why is no real title available?)
• Bounding and nonbounding minimal pairs in the enumeration degrees
• Bounded enumeration reducibility and its degree structure

This page was built for publication: Bounding minimal degrees by computably enumerable degrees

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