По вашему запросу найдено документов: 30650
Страница 7 из 3065
Elementary theories and hereditary undecidability for semilattices of numberings. Similar results are obtained for the structure of all computably enumerable equivalence relations on N
Degree Spectra for Transcendence in Fields of any single computably enumerable Turing degree, or of those c.e. degrees above an arbitrary fixed Δ20
ON ТНЕ THEORIES OF ТНЕ STRONGLY BOUNDED TURING DEGREES OF COMPUTABLY ENUMERABLE SETSON ТНЕ THEORIES OF ТНЕ STRONGLY BOUNDED TURING DEGREES OF COMPUTABLY ENUMERABLE SETS
Degree spectra of the successor relation of computable linear orderingsWe establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c
A survey of results on the d-c.e. and n-c.e. degrees of Turing and enumeration degrees of n-c.e. sets. Questions on the structural properties
On computably enumerable structures by the author at Algebra Computability and Logic conference in Kazan, June 1–6, 2014. The paper is a new
Almost computably enumerable families of setsAn almost computably enumerable family that is not Ø′- computably enumerable is constructed
Some Properties of the Upper Semilattice of Computable Families of Computably Enumerable Sets families of computably enumerable sets in Ω. It is proved that ideals of minuend and finite families of Ω
Degree spectra of the successor relation of computable linear orderingsWe establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c
Positive Presentations of Families Relative to e-Oracles considered here. The problem is investigated of the existence of positive and decidable computable A
Страница 7 из 3065
Фасеты
Партнеры
Индексация
