Loading...
Please wait, while we are loading the content...
Similar Documents
Friedberg Numberings of Families of n-Computably Enumerable Sets
| Content Provider | Semantic Scholar |
|---|---|
| Author | Goncharov, Sergey S. Lempp, Steffen Solomon, Dylan Raymond. |
| Copyright Year | 2002 |
| Abstract | We establish a number of results on numberings, in particular, on Friedberg numberings, of families of d.c.e. sets. First, it is proved that there exists a Friedberg numbering of the family of all d.c.e. sets. We also show that this result, patterned on Friedberg's famous theorem for the family of all c.e. sets, holds for the family of all n-c.e. sets for any n>2. Second, it is stated that there exists an infinite family of d.c.e. sets without a Friedberg numbering. Third, it is shown that there exists an infinite family of c.e. sets (treated as a family of d.c.e. sets) with a numbering which is unique up to equivalence. Fourth, it is proved that there exists a family of d.c.e. sets with a least numbering (under reducibility) which is Friedberg but is not the only numbering (modulo reducibility). |
| Starting Page | 81 |
| Ending Page | 86 |
| Page Count | 6 |
| File Format | PDF HTM / HTML |
| DOI | 10.1023/A:1015352513117 |
| Alternate Webpage(s) | http://www.math.wisc.edu/~lempp/papers/fried.pdf |
| Alternate Webpage(s) | https://doi.org/10.1023/A%3A1015352513117 |
| Volume Number | 41 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
