5 research outputs found
On downey's conjecture
Get PDFWe prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. More specifically, we show that the following statement fails in the former but holds in the latter structure: There are degrees f > e > d > 0 such that any degree u < f is either comparable with both e and d, or incomparable with both. © 2010. Association for Symbolic Logic
Структурные свойства тьюринговых степеней множеств из иерархии Ершова: автореферат диссертации на соискание ученой степени к.ф.-м.н.: специальность 01.01.06
Get PDFOn downey's conjecture
Get PDFWe prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. More specifically, we show that the following statement fails in the former but holds in the latter structure: There are degrees f > e > d > 0 such that any degree u < f is either comparable with both e and d, or incomparable with both. © 2010. Association for Symbolic Logic
On downey's conjecture
No full textWe prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. More specifically, we show that the following statement fails in the former but holds in the latter structure: There are degrees f > e > d > 0 such that any degree u < f is either comparable with both e and d, or incomparable with both. © 2010. Association for Symbolic Logic
On downey's conjecture
No full textWe prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. More specifically, we show that the following statement fails in the former but holds in the latter structure: There are degrees f > e > d > 0 such that any degree u < f is either comparable with both e and d, or incomparable with both. © 2010. Association for Symbolic Logic
