Bounding computably enumerable degrees in the Ershov hierarchy

10.1016/j.apal.2005.10.004

Saved in:
Bibliographic Details
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
id sg-nus-scholar.10635-102949
record_format dspace
spelling sg-nus-scholar.10635-1029492023-10-25T22:25:20Z Bounding computably enumerable degrees in the Ershov hierarchy Li, A. Wu, G. Yang, Y. MATHEMATICS Computably enumerable degrees Ershov hierarchy Highness 10.1016/j.apal.2005.10.004 Annals of Pure and Applied Logic 141 1-2 79-88 APALD 2014-10-28T02:31:33Z 2014-10-28T02:31:33Z 2006-08 Article Li, A., Wu, G., Yang, Y. (2006-08). Bounding computably enumerable degrees in the Ershov hierarchy. Annals of Pure and Applied Logic 141 (1-2) : 79-88. ScholarBank@NUS Repository. https://doi.org/10.1016/j.apal.2005.10.004 01680072 http://scholarbank.nus.edu.sg/handle/10635/102949 000238296000006 Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
topic Computably enumerable degrees
Ershov hierarchy
Highness
spellingShingle Computably enumerable degrees
Ershov hierarchy
Highness
Li, A.
Wu, G.
Yang, Y.
Bounding computably enumerable degrees in the Ershov hierarchy
description 10.1016/j.apal.2005.10.004
author2 MATHEMATICS
author_facet MATHEMATICS
Li, A.
Wu, G.
Yang, Y.
format Article
author Li, A.
Wu, G.
Yang, Y.
author_sort Li, A.
title Bounding computably enumerable degrees in the Ershov hierarchy
title_short Bounding computably enumerable degrees in the Ershov hierarchy
title_full Bounding computably enumerable degrees in the Ershov hierarchy
title_fullStr Bounding computably enumerable degrees in the Ershov hierarchy
title_full_unstemmed Bounding computably enumerable degrees in the Ershov hierarchy
title_sort bounding computably enumerable degrees in the ershov hierarchy
publishDate 2014
url http://scholarbank.nus.edu.sg/handle/10635/102949
_version_ 1781787659824267264