Extending the Cooper minimal pair theorem

DOI10.1007/BF02948855zbMath0981.03047OpenAlexW1973509771MaRDI QIDQ5934293

Zaiyue Zhang

Publication date: 23 September 2001

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

minimal pairrecursively enumerable degree

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On a conjecture of Lempp
• Bounding cappable degrees
• The recursively enumerable degrees are dense
• Minimal pairs and high recursively enumerable degrees
• Working below a high recursively enumerable degree
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees

This page was built for publication: Extending the Cooper minimal pair theorem