Minimal generalized computable enumerations and high degrees© 2017, Pleiades Publishing, Ltd. We establish that the
set of minimal generalized
computable Minimal generalized computable enumerations and high degrees© 2017, Pleiades Publishing, Ltd. We establish that the
set of minimal generalized
computable Turing and enumeration jumps in the Ershov hierarchyIn the article, we study the behaviour of
enumeration jumps of
sets of low e-degrees in the Ershov
Q-reducibility and m-reducibility on computably enumerable sets-reducibility on
computably enumerable sets. We construct a noncomputable m-incomplete
computably enumerable set B
Complements for enumeration Π1 0-degrees of cocomputably
enumerable sets in the local structure of e-degrees. © 2013 Pleiades Publishing, Ltd.
Isolated 2-computably enumerable Q-degreesIn this work we prove that for every pair of
computably enumerable degrees a
Isolated 2-computably enumerable Q-degreesIn this work we prove that for every pair of
computably enumerable degrees a
Q-reducibility and m-reducibility on computably enumerable sets-reducibility on
computably enumerable sets. We construct a noncomputable m-incomplete
computably enumerable set B
Complements for enumeration Π1 0-degrees of cocomputably
enumerable sets in the local structure of e-degrees. © 2013 Pleiades Publishing, Ltd.
Strong noncuppability in low computably enumerable degreesWe prove the existence of noncomputable low
computably enumerable degrees b < a such that b
Страница 1 из 2162