Bounding cappable degrees

DOI10.1007/S001530050152zbMath0974.03039OpenAlexW2064745568MaRDI QIDQ1576591

Ang Sheng Li

Publication date: 7 October 2001

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050152

zbMATH Keywords

minimal pairsTuring reducibilityTuring degreesrecursively enumerable degreescappable degrees

Mathematics Subject Classification ID

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

Related Items (1)

Extending the Cooper minimal pair theorem

This page was built for publication: Bounding cappable degrees