This thesis is concerned with various degree structures below 0', varying from Turing degrees to truth-table degrees, from computably enumerable degrees to ∆_2^0 degrees. In Chapter 1, we first provide a general introduction to the development of computability theory in the last few decades, after which, we will present the motivation of our results contained in this thesis. Notation and terminology will be introduced briey at the end of this chapter.DOCTOR OF PHILOSOPHY (SPMS
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
This thesis mainly studies the thin-free degrees. We show the technique to construct a thin-free deg...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
The structure of the Turing degrees was introduced by Kleene and Post in 1954 [KP54]. Since then, it...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
In this work, we review results of the last years related to the development of the structural theor...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
Our objects of study are infinite sequences and how they can be transformed into each other. As tran...
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
We explore various areas of computability theory, ranging from applications in computable structure ...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
This thesis mainly studies the thin-free degrees. We show the technique to construct a thin-free deg...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
The structure of the Turing degrees was introduced by Kleene and Post in 1954 [KP54]. Since then, it...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
In this work, we review results of the last years related to the development of the structural theor...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
Our objects of study are infinite sequences and how they can be transformed into each other. As tran...
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
We explore various areas of computability theory, ranging from applications in computable structure ...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
This thesis mainly studies the thin-free degrees. We show the technique to construct a thin-free deg...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...