A $\Delta^0_2$ Set with Barely $\Sigma^0_2$ Degree
Downey, Rod ; Laforte, Geoffrey ; Lempp, Steffen
J. Symbolic Logic, Tome 64 (1999) no. 1, p. 1700-1718 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We construct a $\Delta^0_2$ degree which fails to be computably enumerable in any computably enumerable set strictly below $\emptyset'$.
Publié le : 1999-12-14
Classification:  
@article{1183745948,
     author = {Downey, Rod and Laforte, Geoffrey and Lempp, Steffen},
     title = {A $\Delta^0\_2$ Set with Barely $\Sigma^0\_2$ Degree},
     journal = {J. Symbolic Logic},
     volume = {64},
     number = {1},
     year = {1999},
     pages = { 1700-1718},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745948}
}

Downey, Rod; Laforte, Geoffrey; Lempp, Steffen. A $\Delta^0_2$ Set with Barely $\Sigma^0_2$ Degree. J. Symbolic Logic, Tome 64 (1999) no. 1, pp.  1700-1718. http://gdmltest.u-ga.fr/item/1183745948/