CIE
2009
Springer
14 years 9 months ago
2009
Springer
We show that every real low for Demuth randomness is of hyperimmune-free degree.
CIE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...
CIE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
CIE
2009
Springer
14 years 9 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
CIE
2009
Springer
14 years 9 months ago
2009
Springer
We introduce the notions of a complete set of computably infinitary Π0 n relations on a structure, of the jump of a structure, and of admitting nth jump inversion.
CIE
2009
Springer
14 years 9 months ago
2009
Springer
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...
CIE
2009
Springer
14 years 9 months ago
2009
Springer
CIE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
CIE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Computational biomodelers adopt either of the following approaches: build rich, as complete as possible models in an effort to obtain very realistic models, or on the co...
CIE
2009
Springer
14 years 9 months ago
2009
Springer
This paper is an attempt to refine Hernest’s [2] extension of Berger’s uniform quantifiers [1] to G¨odel’s functional (Dialectica) interpretation [3]. We consider the poss...