Bounding computably enumerable degrees in the Ershov hierarchy
10.1016/j.apal.2005.10.004
Saved in:
Main Authors: | Li, A., Wu, G., Yang, Y. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/102949 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
ON TRANSFINITE LEVELS OF THE ERSHOV HIERARCHY
by: PENG CHENG
Published: (2018) -
Posts programme for the Ershov hierarchy
by: Afshari, B., et al.
Published: (2014) -
Computable categoricity and the Ershov hierarchy
by: Khoussainov, B., et al.
Published: (2014) -
The existence of high nonbounding degrees in the difference hierarchy
by: Chong, C.T., et al.
Published: (2014) -
Cupping and jump classes in the computably enumerable degrees
by: Greenberg, Noam, et al.
Published: (2022)