AbstractWe show that every nontrivial interval in the recursively enumerable degrees contains an incomparable pair which have an infimum in the recursively enumerable degrees
This dissertation is a contribution to the theory of the Turing degrees of sets of natural numbers. ...
AbstractWe show that the identity bounded Turing degrees of computably enumerable sets are not dense
We study connections between classical asymptotic density, computabil-ity and computable enumerabili...
AbstractWe show that every nontrivial interval in the recursively enumerable degrees contains an inc...
AbstractLet b and c be r.e. Turing degrees such that b>c. We show that there is an r.e. degree a suc...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
Several problems in recursion theory on admissible o¡dinals (a-recursion theory) and recursion theor...
AbstractWe provide three new results about interpolating 2-r.e. (i.e. d-r.e.) or 2-REA (recursively ...
The Sacks Density Theorem (Sacks 1964) states that the Turing degrees of the recursively enumerable ...
AbstractLet A be a recursive structure, and let R be a recursive relation on A. Harizanov (1991) iso...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
AbstractA certain lattice with eight elements is shown to be not embeddable as a lattice in the recu...
AbstractIn this paper we will discuss some problems of degree-theoretic nature in connection with re...
This dissertation is a contribution to the theory of the Turing degrees of sets of natural numbers. ...
This dissertation is a contribution to the theory of the Turing degrees of sets of natural numbers. ...
AbstractWe show that the identity bounded Turing degrees of computably enumerable sets are not dense
We study connections between classical asymptotic density, computabil-ity and computable enumerabili...
AbstractWe show that every nontrivial interval in the recursively enumerable degrees contains an inc...
AbstractLet b and c be r.e. Turing degrees such that b>c. We show that there is an r.e. degree a suc...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
Several problems in recursion theory on admissible o¡dinals (a-recursion theory) and recursion theor...
AbstractWe provide three new results about interpolating 2-r.e. (i.e. d-r.e.) or 2-REA (recursively ...
The Sacks Density Theorem (Sacks 1964) states that the Turing degrees of the recursively enumerable ...
AbstractLet A be a recursive structure, and let R be a recursive relation on A. Harizanov (1991) iso...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
AbstractA certain lattice with eight elements is shown to be not embeddable as a lattice in the recu...
AbstractIn this paper we will discuss some problems of degree-theoretic nature in connection with re...
This dissertation is a contribution to the theory of the Turing degrees of sets of natural numbers. ...
This dissertation is a contribution to the theory of the Turing degrees of sets of natural numbers. ...
AbstractWe show that the identity bounded Turing degrees of computably enumerable sets are not dense
We study connections between classical asymptotic density, computabil-ity and computable enumerabili...
DOI
Add to ORKG