摘要: If S is a finite set, let ∣ be the cardinality of . We show that if m ∈ ω , A ⊆ B and i : ≤ 2 & x }∣ can computed by an algorithm which, for all 1 …, makes at most queries to then recursive in halting set K = 1, we recursive.
sci-hub.se 参考文章(5)
Richard Beigel, Query-limited reducibilities Stanford University. ,(1988)
Kenneth Kunen, Set Theory: An Introduction to Independence Proofs ,(2011)
Douglas Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare, Stanley S. Wainer, Members of countable π10 classes Annals of Pure and Applied Logic. ,vol. 31, pp. 145- 163 ,(1986) , 10.1016/0168-0072(86)90067-9
Solomon Feferman, Hartley Rogers, Theory of Recursive Functions and Effective Computability. American Mathematical Monthly. ,vol. 76, pp. 715- ,(1969) , 10.2307/2316720
R. L. Epstein, Degrees of Unsolvability: Structure and Theory Lecture Notes in Mathematics. ,(1979) , 10.1007/BFB0067135