质,比如R是稠密的(Sacks (1964)),即(∀a,b ∈ R)(a < b → (∃c ∈ R)(a < c < b));R 是一个上半格,一般来说两个元素的下确界不存在(Lachlan (1966),Yates (1966))。 Sacks稠密性定理的证明导致许多人猜测R是一个简单的结构,比如:Shoenfield (1965)猜想这个结构是齐次的(即如果一个偏序P可以嵌入R中,而且Q是P
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
Several problems in recursion theory on admissible o¡dinals (a-recursion theory) and recursion theor...
The material presented in this paper lies in the realm of recursive function theory. Major emphasis ...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
this paper were then used to refute Sacks' conjecture on the isomorphism of the r. e. degrees t...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
於 城崎国際アートセンター(2017年10月24日-10月27日)平成29年度科学研究費補助金 基盤研究(S)(課題番号25220701, 代表 向井 茂), 平成29年度科学研究費補助金 基盤研究(...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1980.Vita.Bibliography:...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
Several problems in recursion theory on admissible o¡dinals (a-recursion theory) and recursion theor...
The material presented in this paper lies in the realm of recursive function theory. Major emphasis ...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
this paper were then used to refute Sacks' conjecture on the isomorphism of the r. e. degrees t...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
於 城崎国際アートセンター(2017年10月24日-10月27日)平成29年度科学研究費補助金 基盤研究(S)(課題番号25220701, 代表 向井 茂), 平成29年度科学研究費補助金 基盤研究(...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1980.Vita.Bibliography:...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...