×

A decomposition of the Rogers semilattice of a family of d.c.e. sets. (English) Zbl 1185.03071

The authors prove the following:
“Main Theorem. There is a family \(\mathcal F\) of d.c.e. sets, and there are computable numberings \(\mu\) and \(\nu\) of the family \(\mathcal F\) such that \(\mu \not\leq \nu\) and such that for any computable numbering \(\pi\) of \(\mathcal F\), either \(\mu\leq\pi\) or \(\pi\leq\nu\). In addition, we can ensure the following:
1) \(\mathcal F\) is a family of c.e. sets and \(\nu\) is a computable numbering of \(\mathcal F\) as a family of c.e. sets;
2) both \(\mu\) and \(\nu\) can be made Friedberg and thus minimal numberings; and so
3) any computable numbering \(\pi\) of \(\mathcal F\) satisfies \(\pi\equiv\nu\) or \(\mu\leq\pi\).”

MSC:

03D45 Theory of numerations, effectively presented structures
03D25 Recursively (computably) enumerable sets and degrees
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Computability and models. Perspectives east and west pp 11– (2003)
[2] DOI: 10.1002/malq.19730191901 · Zbl 0295.02025
[3] Computability theory and its applications. Current trends and open problems pp 23– (2000)
[4] Recursively enumerable sets and degrees (1987)
[5] Algebra i Logika 10 pp 561– (1971)
[6] Siberian Advances in Mathematics 4 pp 52– (1994)
[7] Computability and models. Perspectives east and west pp 79– (2003)
[8] DOI: 10.1007/BF01982111 · Zbl 0572.03023
[9] Trudy Inst. Matem. SO AN SSSR 2 pp 4– (1982)
[10] Handbook of computability theory pp 473– (1999)
[11] Algebra i Logika 19 pp 507– (1980)
[12] Theory of numerations (1977)
[13] DOI: 10.1002/malq.19770231902 · Zbl 0374.02028
[14] DOI: 10.1002/malq.19750210164
[15] Computability and models, perspectives east and west pp 45– (2003)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.