Classes bounded by incomplete sets
暂无分享,去创建一个
[1] H. Rogers,et al. Reducibility and Completeness for Sets of Integers , 1959 .
[2] A. H. Lachlan,et al. -complete sets are not necessarily -complete , 1975 .
[3] P. Odifreddi. Classical recursion theory , 1989 .
[4] C. E. M. Yates,et al. On the degrees of index sets. II , 1966 .
[5] J. C. E. Dekker,et al. A theorem on hypersimple sets , 1954 .
[6] C. Jockusch. Semirecursive sets and positive reducibility , 1968 .
[7] G. Kobzev. Recursively enumerable bw-degrees , 1977 .
[8] R. Downey,et al. T-degrees, jump classes, and strong reducibilities , 1987 .
[9] Rodney G. Downey,et al. Degree theoretic definitions of the low2 recursively enumerable sets , 1995, Journal of Symbolic Logic.
[10] C. Jockusch. Degrees in Which the Recursive Sets are Uniformly Recursive , 1972, Canadian Journal of Mathematics.
[11] S. S. Marchenkov. One class of partial sets , 1976 .
[12] Frank Stephan,et al. Recursion Theoretic Properties of Frequency Computation and Bounded Queries , 1995, Inf. Comput..
[13] André Nies,et al. The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability , 1992, J. Symb. Log..
[14] Alistair H. Lachlan. A Note on Universal Sets , 1966, J. Symb. Log..
[15] R. Soare. Recursively enumerable sets and degrees , 1987 .