Mathematical Logic Quarterly 51 (2):111-119 (2005)

Say that α is an n-strongly c. e. real if α is a sum of n many strongly c. e. reals, and that α is regular if α is n-strongly c. e. for some n. Let Sn be the set of all n-strongly c. e. reals, Reg be the set of regular reals and CE be the set of c. e. reals. Then we have: S1 ⊂ S2 ⊂ · · · ⊂ Sn ⊂ · · · ⊂ ⊂ Reg ⊂ CE. This gives a hierarchy of the c. e. reals. We also study the regularity of the d. c. e. reals
Keywords domination reducibility  regular reals  hierarchy  Computably enumerable reals
Categories (categorize this paper)
DOI 10.1002/malq.200310129
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 54,431
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
10 ( #826,032 of 2,374,851 )

Recent downloads (6 months)
2 ( #369,908 of 2,374,851 )

How can I increase my downloads?


My notes