An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreover, it is established that for any computably enumerable (c.e.) set A there exists afamily that is X-c.e. if and only if the set X is not A-computable. © 2008 Russian Academy of Sciences, (DoM) and London Mathematical Society, Turpion Ltd
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreove...
An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreove...
An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreove...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
Abstract. We survey some of the recent results on the structure of the computably enumerable (c.e.) ...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreove...
An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreove...
An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreove...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
Abstract. We survey some of the recent results on the structure of the computably enumerable (c.e.) ...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...