کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8904280 | 1633415 | 2018 | 32 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Splitting into degrees with low computational strength
ترجمه فارسی عنوان
تقسیم به درجه با قدرت محاسبه کم
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
منطق ریاضی
چکیده انگلیسی
We investigate the extent to which a c.e. degree can be split into two smaller c.e. degrees which are computationally weak. In contrast to a result of Bickford and Mills that 0â² can be split into two superlow c.e. degrees, we construct a SJT-hard c.e. degree which is not the join of two superlow c.e. degrees. We also prove that every high c.e. degree is the join of two array computable c.e. degrees, and that not every high2 c.e. degree can be split in this way. Finally we extend a result of Downey, Jockusch and Stob by showing that no totally Ï-c.a. wtt-degree can be cupped to the complete wtt-degree.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Annals of Pure and Applied Logic - Volume 169, Issue 8, August 2018, Pages 803-834
Journal: Annals of Pure and Applied Logic - Volume 169, Issue 8, August 2018, Pages 803-834
نویسندگان
Rod Downey, Keng Meng Ng,