Several problems in recursion theory on admissible o¡dinals (a-recursion theory) and recursion theory on inadmissible ordinals (B-recursion theory) are studied. Fruitful interactions betweenboth theories are stressed. In the fr¡stpart the admissible collapse is used in order to characterizefor some inadmissible B the structure of all p-recursively enumerable degrees asanaccumulationof structures of 2[-recursively enumerable degrees for many admissible structures 2[. Thus problems about the B-recursively enumerable degrees can be solved by considering "locally " the analogous problem in an admissible 2 [ (where results of a-recursion theory apply). In the second part p-recursion theory is used as a tool in infinite injurypriority c...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
AbstractLet A be a recursive structure, and let R be a recursive relation on A. Harizanov (1991) iso...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
'We int¡oduce recursively invariant p-recursion theory as a new approach towards recursion theo...
The material presented in this paper lies in the realm of recursive function theory. Major emphasis ...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
质,比如R是稠密的(Sacks (1964)),即(∀a,b ∈ R)(a < b → (∃c ∈ R)(a < c < b));R 是一个上半格,一般来说两个元素的下确界不存在(L...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
AbstractLet A be a recursive structure, and let R be a recursive relation on A. Harizanov (1991) iso...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
'We int¡oduce recursively invariant p-recursion theory as a new approach towards recursion theo...
The material presented in this paper lies in the realm of recursive function theory. Major emphasis ...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
质,比如R是稠密的(Sacks (1964)),即(∀a,b ∈ R)(a < b → (∃c ∈ R)(a < c < b));R 是一个上半格,一般来说两个元素的下确界不存在(L...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
AbstractLet A be a recursive structure, and let R be a recursive relation on A. Harizanov (1991) iso...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...