Add to ORKGThe polynomial-time hierarchy (PH) is central for many considerations of complexity theory. We call ...
The text focuses on the subject of family and values. It aims to show where in the hierarchy of valu...
Generalizations to various levels of Ershov's hierarchy of the relationship between n-computable enu...
© 2015, Springer Science+Business Media New York. Presented by the Program Committee of the Conferen...
© J.UCS.In this paper we introduce a hierarchy of families which can be derived from the integers us...
In this paper we introduce a hierarchy of families which can be derived from the integers using coun...
© 2016 WILEY-VCH Verlag GmbH & Co. KGaA, WeinheimWe introduce a hierarchy of sets which can be deriv...
AbstractThis paper gives two definability results in the local theory of the ω-enumeration degrees. ...
© J.UCS. Studying the Σ-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we sh...
We survey known results on spectra of structures and on spectra of relations on computable structure...
After showing the downwards density of nonhemimaximal degrees, Downey and Stob continued to prove th...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
If ν and μ are some Δcomputable numberings of families of sets of the naturals then P(x,y) ⇔ ν(x)′ ≠...
Abstract. We prove that the existential theory of the Turing degrees, in the language with Turing re...
This paper continues to study these hierarchies, the probably impossible relationships within and be...
The polynomial-time hierarchy (PH) is central for many considerations of complexity theory. We call ...
The text focuses on the subject of family and values. It aims to show where in the hierarchy of valu...
Generalizations to various levels of Ershov's hierarchy of the relationship between n-computable enu...
© 2015, Springer Science+Business Media New York. Presented by the Program Committee of the Conferen...
© J.UCS.In this paper we introduce a hierarchy of families which can be derived from the integers us...
In this paper we introduce a hierarchy of families which can be derived from the integers using coun...
© 2016 WILEY-VCH Verlag GmbH & Co. KGaA, WeinheimWe introduce a hierarchy of sets which can be deriv...
AbstractThis paper gives two definability results in the local theory of the ω-enumeration degrees. ...
© J.UCS. Studying the Σ-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we sh...
We survey known results on spectra of structures and on spectra of relations on computable structure...
After showing the downwards density of nonhemimaximal degrees, Downey and Stob continued to prove th...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
If ν and μ are some Δcomputable numberings of families of sets of the naturals then P(x,y) ⇔ ν(x)′ ≠...
Abstract. We prove that the existential theory of the Turing degrees, in the language with Turing re...
This paper continues to study these hierarchies, the probably impossible relationships within and be...
The polynomial-time hierarchy (PH) is central for many considerations of complexity theory. We call ...
The text focuses on the subject of family and values. It aims to show where in the hierarchy of valu...
Generalizations to various levels of Ershov's hierarchy of the relationship between n-computable enu...