|
This article is cited in 2 scientific papers (total in 2 papers)
Recursively enumerable $bw$-degrees
G. N. Kobzev Cybernetics Institute, Academy of Sciences of the Georgian SSR
Abstract:
For every nonrecursive recursively enumerable (r.e.) set $A$ are constructed bw-incomparable r.e. sets $B_i$, $i\in N$, such that $B_i<{}_{bw}A$ and $B_i\equiv{}_wA$. The existence of an infinite antichain of r.e. $m$-degrees in every nonrecursive r.e. $bw$-degree, and also that of an r.e. set $A$ with the property $A^n<A^{n+1}$, $n\in N$, is proved.
Received: 01.10.1975
Citation:
G. N. Kobzev, “Recursively enumerable $bw$-degrees”, Mat. Zametki, 21:6 (1977), 839–846; Math. Notes, 21:6 (1977), 473–477
Linking options:
https://www.mathnet.ru/eng/mzm8014 https://www.mathnet.ru/eng/mzm/v21/i6/p839
|
Statistics & downloads: |
Abstract page: | 159 | Full-text PDF : | 73 | First page: | 1 |
|