Translator Disclaimer
September 2005 Bounding and nonbounding minimal pairs in the enumeration degrees
S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang
J. Symbolic Logic 70(3): 741-766 (September 2005). DOI: 10.2178/jsl/1122038912

Abstract

We show that every nonzero Δ⁰₂ e-degree bounds a minimal pair. On theother hand, there exist Σ⁰₂ e-degrees which bound no minimal pair.

Citation

Download Citation

S. Barry Cooper. Angsheng Li. Andrea Sorbi. Yue Yang. "Bounding and nonbounding minimal pairs in the enumeration degrees." J. Symbolic Logic 70 (3) 741 - 766, September 2005. https://doi.org/10.2178/jsl/1122038912

Information

Published: September 2005
First available in Project Euclid: 22 July 2005

zbMATH: 1093.03029
MathSciNet: MR2155264
Digital Object Identifier: 10.2178/jsl/1122038912

Subjects:
Primary: 03D30

Rights: Copyright © 2005 Association for Symbolic Logic

JOURNAL ARTICLE
26 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.70 • No. 3 • September 2005
Back to Top