DOIAbstract
We describe a programme of research which aims to find natural definability results in the Turing degrees through a systematic analysis of the order theoretic properties satisfied by the degrees in each jump class
We describe a programme of research which aims to find natural definability results in the Turing degrees through a systematic analysis of the order theoretic properties satisfied by the degrees in each jump class
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
The Turing degree of a real measures the computational difficulty of producing its binary expansion....
In this work, we review results of the last years related to the development of the structural theor...
We describe a programme of research which aims to find natural definability results in the Turing de...
this paper. Clearly the most remarkable result relating the jump operator to the ordering of degrees...
We review recent developments in the study of jump classes in com- putably enumerable degrees, with ...
In this article, we investigate questions about the definability of classes of n-c. e. sets and degr...
This thesis examines three areas in computability theory. In Chapter 2 we look at certain classes...
Our objects of study are infinite sequences and how they can be transformed into each other. As tran...
AbstractLet D be the set of all (Turing) degrees, < the usual partial ordering of D and j the (Turin...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
In 1936, Alan Turing wrote a remarkable paper giving a negative answer to Hilbert’s Entscheidungspro...
The structure of the Turing degrees was introduced by Kleene and Post in 1954 [KP54]. Since then, it...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
The Turing degree of a real measures the computational difficulty of producing its binary expansion....
In this work, we review results of the last years related to the development of the structural theor...
We describe a programme of research which aims to find natural definability results in the Turing de...
this paper. Clearly the most remarkable result relating the jump operator to the ordering of degrees...
We review recent developments in the study of jump classes in com- putably enumerable degrees, with ...
In this article, we investigate questions about the definability of classes of n-c. e. sets and degr...
This thesis examines three areas in computability theory. In Chapter 2 we look at certain classes...
Our objects of study are infinite sequences and how they can be transformed into each other. As tran...
AbstractLet D be the set of all (Turing) degrees, < the usual partial ordering of D and j the (Turin...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
In 1936, Alan Turing wrote a remarkable paper giving a negative answer to Hilbert’s Entscheidungspro...
The structure of the Turing degrees was introduced by Kleene and Post in 1954 [KP54]. Since then, it...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
The Turing degree of a real measures the computational difficulty of producing its binary expansion....
In this work, we review results of the last years related to the development of the structural theor...
Add to ORKG