Bounding and nonbounding minimal pairs in the enumeration degrees
10.2178/jsl/1122038912
Saved in:
Main Authors: | Cooper, S.B., Li, A., Sorbi, A., Yang, Y. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/102948 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
High minimal pairs in the enumeration degrees
by: Sorbi, A., et al.
Published: (2014) -
There exists a maximal 3-C.E. enumeration degree
by: Cooper, S.B., et al.
Published: (2014) -
The existence of high nonbounding degrees in the difference hierarchy
by: Chong, C.T., et al.
Published: (2014) -
Diamond embeddings into the enumeration degrees
by: Sorbi, A., et al.
Published: (2014) -
Bounding computably enumerable degrees in the Ershov hierarchy
by: Li, A., et al.
Published: (2014)