| Заглавие | Constructing minimal pairs of degrees |
| Вид публикация | Journal Article |
| Година на публикуване | 1997 |
| Автори | Soskov I |
| Списание | Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique |
| Том | 89 |
| Issue | Livre 1 - Mathématiques et Mecanique |
| Pagination | 101-112 |
| ISSN | 0205-0808 |
| ключови думи | Degrees, enumerations, forcing, minimal pairs, reducibilities |
| Резюме | We prove that there exist sets of natural numbers $A$ and $B$ such that $A$ and $B$ form a minimal pair with respect to Turing reducibility, enumeration reducibility, hyperarithmetical reducibility and hyperenumeration reducibility. Relativized versions of this result are presented as well. |
| 1991/95 MSC | 03D30 |
| Прикачен файл | Размер |
|---|---|
 89-101-112.pdf | 1.12 MB |