Continuity of capping in \(\mathcal C_{\text{bT}}\)

DOI10.1016/J.APAL.2008.02.002zbMath1146.03029OpenAlexW2036980988MaRDI QIDQ947265

Weilin Li, Paul Brodhead, Ang Sheng Li

Publication date: 29 September 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.02.002

zbMATH Keywords

continuitycomputabilitycomputably enumerable degreesbounded Turing reduciblebT-degreesnoncappabilityweak truth table reducible

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Principal filters definable by parameters in 𝓔_bT

Cites Work

• Unnamed Item
• Unnamed Item
• Effectively closed sets and enumerations
• On Lachlan's major sub-degree problem
• The continuity of cupping to \(\text \textbf{0}'\)
• The computably enumerable degrees are locally non-cappable
• Turing Computability
• Definable Filters in the Structure of Bounded Turing Reductions
• Wtt-degrees and T-degrees of r.e. sets
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees
• Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices

This page was built for publication: Continuity of capping in \(\mathcal C_{\text{bT}}\)