Computable categoricity and the Ershov hierarchy
10.1016/j.apal.2008.06.010
Saved in:
Main Authors: | Khoussainov, B., Stephan, F., Yang, Y. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/103019 |
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) -
Bounding computably enumerable degrees in the Ershov hierarchy
by: Li, A., et al.
Published: (2014) -
Posts programme for the Ershov hierarchy
by: Afshari, B., et al.
Published: (2014) -
The existence of high nonbounding degrees in the difference hierarchy
by: Chong, C.T., et al.
Published: (2014) -
The Diversity of Categoricity Without Delay
by: Kalimullin, I. S., et al.
Published: (2017)