Add to ORKG© 2018, Pleiades Publishing, Ltd. In the paper we study the differences and partial characterizations of the Turing and enumeration computable embeddings of classes of structures
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
In this article, we investigate model-theoretic properties of various Turing degree structures in th...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
© 2018, Pleiades Publishing, Ltd. In the paper we study the differences and partial characterization...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
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 ...
© 2016, Pleiades Publishing, Ltd.This paper is a survey on the upper semilattices of Turing and enum...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
The main theme of this thesis is studying classes of structures with respect to various measurements...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
The structure of the Turing degrees was introduced by Kleene and Post in 1954 [KP54]. Since then, it...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two no...
The concept of a computable function is quite a well-studied one, however, it is possible to capture...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
In this article, we investigate model-theoretic properties of various Turing degree structures in th...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
© 2018, Pleiades Publishing, Ltd. In the paper we study the differences and partial characterization...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
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 ...
© 2016, Pleiades Publishing, Ltd.This paper is a survey on the upper semilattices of Turing and enum...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
The main theme of this thesis is studying classes of structures with respect to various measurements...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
The structure of the Turing degrees was introduced by Kleene and Post in 1954 [KP54]. Since then, it...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two no...
The concept of a computable function is quite a well-studied one, however, it is possible to capture...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
In this article, we investigate model-theoretic properties of various Turing degree structures in th...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...