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
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
© 2016, Pleiades Publishing, Ltd.This paper is a survey on the upper semilattices of Turing and enum...
© 2018, Pleiades Publishing, Ltd. In the paper we study the differences and partial characterization...
Abstract. We survey some of the recent results on the structure of the computably enumerable (c.e.) ...
The concept of a computable function is quite a well-studied one, however, it is possible to capture...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
One of the most basic measures of the complexity of a given partially ordered structure is the quant...
The structure of the Turing degrees was introduced by Kleene and Post in 1954 [KP54]. Since then, it...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
Abstract. Computably enumerable algebras are the ones whose positive atomic diagrams are computably ...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
© 2016, Pleiades Publishing, Ltd.This paper is a survey on the upper semilattices of Turing and enum...
© 2018, Pleiades Publishing, Ltd. In the paper we study the differences and partial characterization...
Abstract. We survey some of the recent results on the structure of the computably enumerable (c.e.) ...
The concept of a computable function is quite a well-studied one, however, it is possible to capture...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
One of the most basic measures of the complexity of a given partially ordered structure is the quant...
The structure of the Turing degrees was introduced by Kleene and Post in 1954 [KP54]. Since then, it...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
Abstract. Computably enumerable algebras are the ones whose positive atomic diagrams are computably ...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
© 2016, Pleiades Publishing, Ltd.This paper is a survey on the upper semilattices of Turing and enum...