
doi: 10.3233/com-150046
We study Kalimullin pairs, a definable class (of pairs) of enumeration degrees that has been used to give first-order definitions of other important classes and relations, including the enumeration jump and the total enumeration degrees. We show that the global definition of Kalimullin pairs is also valid in the local structure of the enumeration degrees, giving a simpler local definition than was previously known. We prove that the typical enumeration degree is not half of a nontrivial Kalimullin pair, both in the sense of category and measure. Using genericity, we show that not all members of nontrivial Kalimullin pairs are half of a maximal Kalimullin pair. Finally, we construct such a set that has no maximal Kalimullin partner, making it qualitatively different from half of a maximal Kalimullin pair.
Kalimullin pairs, Recursively (computably) enumerable sets and degrees, enumeration reducibility, Other degrees and reducibilities in computability and recursion theory, genericity
Kalimullin pairs, Recursively (computably) enumerable sets and degrees, enumeration reducibility, Other degrees and reducibilities in computability and recursion theory, genericity
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
