Add to ORKGAbstract. Based on a result of Nies on definability the upper semilattice of computably enumerable degrees (denoted by R), we find that in R filters gen-erated by definable subsets are also definable. As applications we demonstrate two new definable filters and study their supremum. Finally we demonstrate a counterexample. 1
The work is devoted to combinatorial properties of filters on natural num- bers as an introduction a...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...
We prove definability results for the structure R T of computably enumerable Turing degrees. Some o...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the leas...
Abstract. We survey the current status of an old open question in classical computability theory: Wh...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
We show that there exists a set A such that A has quasi-minimal enumeration degree, and there are un...
The work is devoted to combinatorial properties of filters on natural num- bers as an introduction a...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...
We prove definability results for the structure R T of computably enumerable Turing degrees. Some o...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the leas...
Abstract. We survey the current status of an old open question in classical computability theory: Wh...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
We show that there exists a set A such that A has quasi-minimal enumeration degree, and there are un...
The work is devoted to combinatorial properties of filters on natural num- bers as an introduction a...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...