По вашему запросу найдено документов: 272625
Страница 5 из 27263
Non-isolated quasi-degreesWe show that non-isolated from below 2-c.e. Q-degrees are dense in the structure of c.e. Q-degrees
Splitting properties of n-C.E. enumeration degrees. n-c.e. e-degrees are distinct. It is proved also that the structures 〈D2n ≤ P〉 and 〈D2n ≤ P
Boolean algebras realized by c.e. equivalence relationsBoolean algebras realized by c.e. equivalence relations
A semilattice generated by superlow computably enumerable degreesWe prove that a partially ordered set of all computably enumerable (c. e.) degrees
The complements of lower cones of degrees and the degree spectra of structures© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable
Q-degrees of n-C.E. setsIn this paper we study Q-degrees of n-computably enumerable (n-c.e.) sets. It is proved that n-c.e
Nonexistence of minimal pairs in L[d]. approximation (Formula presented.), the Lachlan set of D is defined as (Formula presented.). For a d.c.e. degree
The minimal e-degree problem in fragments of Peano arithmeticWe study the minimal enumeration degree (e-degree) problem in models of fragments of Peano
Конечные группы, n-максимальные подгруппы которых являются обобщенно s-квазинормальнымиFinite groups whose n-maximal subgroups are generalized s-quasinormal
Turing Computability: Structural Theory theory of n-c.e. Turing degrees for n > 1. We also discuss possible approaches to solution of the open
Страница 5 из 27263
Фасеты
Партнеры
Индексация
