On Quasi-reducibility

Author: Mishiko Okropiridze
Keywords: computability theory, recursion theory, quasi reduction
Annotation:

We show that if M is a maximal set, A is its major subset, and B, C are arbitrary sets such that, B ≤Q₁ M\A, C ≤Q₁ M\A, and M\A ≤Q₁ B ⊕ C, then M\A ≤ₘ B or M\A ≤ₘ C.

Lecture files:

კვაზი დაყვანადობის შესახებ [ka]