По вашему запросу найдено документов: 16008
Страница 4 из 1601
Presentations of the successor relation of computable linear orderingWe prove that a nontrivial degree spectrum of the successor relation of either strongly η
There are no maximal d.c.e. wtt-degreesThere are no maximal d.c.e. wtt-degrees
Turing reducibility in the fine hierarchy. In this paper we use a 0‴ construction to show that the Σ30 Turing degrees are properly contained in the Σωω+2
Elementary theories and structural properties of d-c.e. and n-c.e. degrees© 2016, Pleiades Publishing, Ltd.This paper is a survey on the upper semilattices of Turing
Uniform reducibility of representability problems for algebraic structuresGiven a countable algebraic structure B with no degree we find sufficient conditions
Elementary theories and structural properties of d-c.e. and n-c.e. degrees© 2016, Pleiades Publishing, Ltd.This paper is a survey on the upper semilattices of Turing
Model-theoretic properties of the m-c.e. degreesIn this article, we investigate model-theoretic properties of various Turing degree structures
Turing Computability: Structural Theory theory of n-c.e. Turing degrees for n > 1. We also discuss possible approaches to solution of the open
Elementary Theories and Structural properties of D-C.E and N-C.E. DegreesIn the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems
Relative enumerability in Ershov's hierarchyTuring degree
Страница 4 из 1601
Фасеты
Партнеры
Индексация
