Add to ORKGSIGLETIB: RN 4237 (206) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
AbstractWe prove a number of structural theorems about the honest polynomial m-degrees (denoted by H...
质，比如R是稠密的（Sacks (1964)），即(∀a,b ∈ R)(a < b → (∃c ∈ R)(a < c < b))；R 是一个上半格，一般来说两个元素的下确界不存在（L...
AbstractThere is an interpretation of first-order arithmetic in the theory of the PTIME degrees of t...
AbstractIf I is a set of Δ02 low sets which is closed under recursive join and downward closed under...
AbstractAmbos-Spies (1984a) showed that the two basic nondistributive lattices can be embedded in Rp...
AbstractThe central problem considered in this paper is whether a given recursive structure is recur...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analys...
AbstractThe goal of extending work on relative polynomial time computability from computations relat...
this paper. Clearly the most remarkable result relating the jump operator to the ordering of degrees...
Several problems in recursion theory on admissible o¡dinals (a-recursion theory) and recursion theor...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
For recursive sets A, define a complexity theoretic version of the ordinary recursion theoretic jump...
Nous nous plaçons dans le modèle de calcul BSS sur des structures arbitraires. Nous présentons de no...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
AbstractWe prove a number of structural theorems about the honest polynomial m-degrees (denoted by H...
质，比如R是稠密的（Sacks (1964)），即(∀a,b ∈ R)(a < b → (∃c ∈ R)(a < c < b))；R 是一个上半格，一般来说两个元素的下确界不存在（L...
AbstractThere is an interpretation of first-order arithmetic in the theory of the PTIME degrees of t...
AbstractIf I is a set of Δ02 low sets which is closed under recursive join and downward closed under...
AbstractAmbos-Spies (1984a) showed that the two basic nondistributive lattices can be embedded in Rp...
AbstractThe central problem considered in this paper is whether a given recursive structure is recur...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analys...
AbstractThe goal of extending work on relative polynomial time computability from computations relat...
this paper. Clearly the most remarkable result relating the jump operator to the ordering of degrees...
Several problems in recursion theory on admissible o¡dinals (a-recursion theory) and recursion theor...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
For recursive sets A, define a complexity theoretic version of the ordinary recursion theoretic jump...
Nous nous plaçons dans le modèle de calcul BSS sur des structures arbitraires. Nous présentons de no...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
AbstractWe prove a number of structural theorems about the honest polynomial m-degrees (denoted by H...
质，比如R是稠密的（Sacks (1964)），即(∀a,b ∈ R)(a < b → (∃c ∈ R)(a < c < b))；R 是一个上半格，一般来说两个元素的下确界不存在（L...