Add to ORKGIn this paper we prove that any Δ0 3 degree has an increasing η-representation. Therefore, there is an increasing η-representable set without a strong η-representation. © 2009 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...
In this paper we prove that any Δ0 3 degree has an increasing η-representation. Therefore, there is ...
It is proved that each strongly η-representable degree contains a set that is a range of values for ...
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
In this article, we investigate model-theoretic properties of various Turing degree structures in th...
Given a countable algebraic structure B with no degree we find sufficient conditions for the existen...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
© 2019 Elsevier B.V. In the late 1980s, Selivanov used typed Boolean combinations of arithmetical se...
© 2018 - IOS Press and the authors. All rights reserved. In 1971 B. Cooper proved that there exists ...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
The Turing degree of a real measures the computational difficulty of producing its binary expansion....
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
In [2], Downey and Greenberg use the ordinals below ε0 to bound the number of mind-changes of comput...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...
In this paper we prove that any Δ0 3 degree has an increasing η-representation. Therefore, there is ...
It is proved that each strongly η-representable degree contains a set that is a range of values for ...
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
In this article, we investigate model-theoretic properties of various Turing degree structures in th...
Given a countable algebraic structure B with no degree we find sufficient conditions for the existen...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
© 2019 Elsevier B.V. In the late 1980s, Selivanov used typed Boolean combinations of arithmetical se...
© 2018 - IOS Press and the authors. All rights reserved. In 1971 B. Cooper proved that there exists ...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
The Turing degree of a real measures the computational difficulty of producing its binary expansion....
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
In [2], Downey and Greenberg use the ordinals below ε0 to bound the number of mind-changes of comput...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...