On the problem of the critical bound

DOI10.1007/BF02582899zbMath0791.03021MaRDI QIDQ4272259

Yuefei Sui

Publication date: 10 January 1994

Published in: Acta Mathematica Sinica (Search for Journal in Brave)

zbMATH Keywords

minimal pairsTuring reducibilityr.e. sets

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The recursively enumerable degrees are dense
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Pseudo Jump Operators. I: The R. E. Case
• Wtt-degrees and T-degrees of r.e. sets
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Decomposition of Recursively Enumerable Degrees
• Uniform enumeration operations
• The weak truth table degrees of recursively enumerable sets

This page was built for publication: On the problem of the critical bound