Definable Filters in the Structure of Bounded Turing Reductions
From MaRDI portal
Publication:3502638
DOI10.1007/978-3-540-79228-4_10zbMath1140.03314OpenAlexW1500811105MaRDI QIDQ3502638
Weilin Li, Lin-Qing Tang, Yicheng Pan, Ang Sheng Li
Publication date: 27 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_10
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Continuity of capping in \(\mathcal C_{\text{bT}}\) ⋮ Principal filters definable by parameters in 𝓔bT