Title of article
Completely mitotic c.e. degrees and non-jump inversion
Author/Authors
Griffiths، نويسنده , , Evan J.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
27
From page
181
To page
207
Abstract
A completely mitotic computably enumerable degree is a c.e. degree in which every c.e. set is mitotic, or equivalently in which every c.e. set is autoreducible. There are known to be low, low2, and high completely mitotic degrees, though the degrees containing non-mitotic sets are dense in the c.e. degrees. We show that there exists an upper cone of c.e. degrees each of which contains a non-mitotic set, and that the completely mitotic c.e. degrees are nowhere dense in the c.e. degrees. We also show that there is a set computably enumerable in and above 0′ which is not the jump of any completely mitotic degree.
Keywords
Mitotic set , Jump inversion , c.e. degree
Journal title
Annals of Pure and Applied Logic
Serial Year
2005
Journal title
Annals of Pure and Applied Logic
Record number
1443614
Link To Document