Structural properties of Q-degrees of n-c. e. sets minimal pair in the
c. e. degrees with a Δ
2 0Q-degree. In a further theorem it is proved that there exists
Q-reducibility and m-reducibility on computably enumerable sets-reducibility on computably enumerable
sets. We construct a noncomputable m-incomplete computably enumerable
set B
О классах линейных и самодвойственных слабо импликативно-селекторных множеств размерности 4) булевой функции β совпадает с одним из классов K(xVy)
c K(xyVxy)
c K(x), соответственно К
Limitwise monotonic reducibility on sets and on pairs of sets© 2016, Allerton Press, Inc.We study limitwise monotonic
sets and pairs of
sets. We investigate
Model-theoretic properties of the m-c.e. degrees in the hierarchy of Δ 0
2-
sets which is well known in the literature as Ershov Hierarchy. In particular, questions
Generalized vector variational inequalities over countable product of setsIn this paper, we consider vector variational inequalities with
set-valued mappings over countable
Inductive Limits for Systems of Toeplitz Algebras set of natural numbers and a reduced semigroup
C*-algebra for a semigroup in the group of all rational
Logic of proofs and labels with a complete set of operationsLogic of proofs and labels with a complete
set of operations
Definable relations in Turing degree structures (
c.
e.)
sets and degrees in the Ershov difference hierarchy. It is proved that the class of all
c.
e Об операциях над рекурсивно-перечислимыми множествами, 2 the classes of recursive, creative, simple, pseudo-simple or pseudo-creative
sets.