Infimum properties differ in the weak truth-table degrees and the Turing degrees

DOI10.1007/S10114-003-0288-9zbMATH Open1063.03027OpenAlexW1963638974MaRDI QIDQ1888712

Liang Yu, Decheng Ding

Publication date: 26 November 2004

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

Full work available at URL: https://doi.org/10.1007/s10114-003-0288-9

zbMATH Keywords

minimal pairr.e. setT-degreewtt-degree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Structural interactions of the recursively enumerable T- and W-degrees
• Splitting theorems in recursion theory
• The weak truth table degrees of recursively enumerable sets

Related Items (2)

Title not available (Why is that?) ⋮ Cupping and noncapping in the r.e. weak truth table and turing degrees

This page was built for publication: Infimum properties differ in the weak truth-table degrees and the Turing degrees

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