Аннотация
A standard tool for classifying the complexity of equivalence relations on ω is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which (Formula presented.), where α ≥ 2 is a computable ordinal and n is a non-zero natural number. We prove that there are infinitely many pairwise incomparable minimal equivalence relations that are properly in Γ.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 145-150 |
Число страниц | 6 |
Журнал | Lobachevskii Journal of Mathematics |
Том | 41 |
Номер выпуска | 2 |
DOI | |
Состояние | Опубликовано - 1 фев 2020 |
Предметные области OECD FOS+WOS
- 1.01.PQ МАТЕМАТИКА