Please use this identifier to cite or link to this item:
https://doi.org/10.2178/jsl/1122038912
| Title: | Bounding and nonbounding minimal pairs in the enumeration degrees | Authors: | Cooper, S.B. Li, A. Sorbi, A. Yang, Y. |
Issue Date: | Sep-2005 | Citation: | Cooper, S.B., Li, A., Sorbi, A., Yang, Y. (2005-09). Bounding and nonbounding minimal pairs in the enumeration degrees. Journal of Symbolic Logic 70 (3) : 741-766. ScholarBank@NUS Repository. https://doi.org/10.2178/jsl/1122038912 | Abstract: | We show that every nonzero Δ2 0 e-degree bounds a minimal pair. On the other hand, there exist ∑2 0 e-degrees which bound no minimal pair. © 2005, Association for Symbolic Logic. | Source Title: | Journal of Symbolic Logic | URI: | http://scholarbank.nus.edu.sg/handle/10635/102948 | ISSN: | 00224812 | DOI: | 10.2178/jsl/1122038912 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.