Электронный архив

Просмотр по теме "Computably enumerable set"

Просмотр по теме "Computably enumerable set"

Отсортировать по:Сортировать:Результаты поиска на странице:

  • Restrictions on the degree spectra of algebraic structures 
    Kalimullin I. (2008)
    We construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b}. Moreover, we solve Miller's problem of distinguishing incomparable degrees by the spectra of linear orderings. © Pleiades ...
  • There is no low maximal d. c. e. degree 
    Arslanov M.; Cooper S.; Li A. (2000)
    We show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L <T A, then there is a c. e. splitting A0 ∐ A1 = A such that Ai ⊗ L <T A. In particular, if L is low and n-c. e., then Ai ⊗ L ...
  • There is no low maximal d. c. e. degree - Corrigendum 
    Arslanov M.; Cooper S.; Li A. (2004)
    We give a corrected proof of an extension of the Robinson Splitting Theorem for the d. c. e. degrees. © 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Поиск в электронном архиве

Просмотр

Моя учетная запись