Title | Constructing minimal pairs of degrees |
Publication Type | Journal Article |
Year of Publication | 1997 |
Authors | Soskov I |
Journal | Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique |
Volume | 89 |
Issue | Livre 1 - Mathématiques et Mecanique |
Pagination | 101-112 |
ISSN | 0205-0808 |
Keywords | Degrees, enumerations, forcing, minimal pairs, reducibilities |
Abstract | 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 |
Attachment | Size |
---|---|
89-101-112.pdf | 1.12 MB |