1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.2178/jsl/1122038912
DC FieldValue
dc.titleBounding and nonbounding minimal pairs in the enumeration degrees
dc.contributor.authorCooper, S.B.
dc.contributor.authorLi, A.
dc.contributor.authorSorbi, A.
dc.contributor.authorYang, Y.
dc.date.accessioned2014-10-28T02:31:32Z
dc.date.available2014-10-28T02:31:32Z
dc.date.issued2005-09
dc.identifier.citationCooper, 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
dc.identifier.issn00224812
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/102948
dc.description.abstractWe 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.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.2178/jsl/1122038912
dc.description.sourcetitleJournal of Symbolic Logic
dc.description.volume70
dc.description.issue3
dc.description.page741-766
dc.identifier.isiut000231402900004
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.