Principal filters definable by parameters in 𝓔bT

DOI10.1017/S0960129508007354zbMath1170.03022OpenAlexW2099447007MaRDI QIDQ3616223

Yicheng Pan, Weilin Li, Lin-Qing Tang, Ang Sheng Li

Publication date: 24 March 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129508007354

zbMATH Keywords

wtt degreebT degree

Mathematics Subject Classification ID

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

Cites Work

• On Lachlan's major sub-degree problem
• Continuity of capping in \(\mathcal C_{\text{bT}}\)
• The continuity of cupping to \(\text \textbf{0}'\)
• Definable Filters in the Structure of Bounded Turing Reductions
• 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: Principal filters definable by parameters in 𝓔_bT