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

Просмотр по автору "Lempp S."

Просмотр по автору "Lempp S."

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

  • Frolov A.N.; Lempp S.; Ng K.M.; Wu G. (2020)
    © 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with the property that given any countable linear order, is a computable linear order iff is a computable linear order, as ...
  • Arslanov M.; Lempp S.; Shore R. (1996)
    We provide three new results about interpolating 2-r.e. (i.e. d-r.e.) or 2-REA (recursively enumerable in and above) degrees between given r.e. degrees: Proposition 1.13. If c < h are r.e., c is low and h is high, then ...
  • Andrews U.; Kuyper R.; Lempp S.; Soskova M.; Yamaleev M. (2017)
    © Springer International Publishing AG 2017.In this paper, we show that the so-called “double bubbles” are not downward dense in the d.c.e. degrees. Here, a pair of d.c.e. degrees d1 > d2 > 0 forms a double bubble if all ...
  • Arslanov M.; Kalimullin I.; Lempp S. (2010)
    We prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. More specifically, we show that the following statement fails in the ...
  • Andrews U.; Cai M.; Kalimullin I.; Lempp S.; Miller J.; Montalbán A. (2016)
    © 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable structure A whose degree spectrum is the collection {x: x ≰ a}. In particular, for degrees a from the interval [0ʹ, 0ʺ ], such ...

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

Просмотр

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