Classification of the Index Sets of Lown~p and High n~p

Sui Yuefei. Classification of the Index Sets of Low[n]~p and High [n]~p[J]. Journal of Computer Science and Technology, 1991, 6(3): 285-290.

Citation:

Sui Yuefei. Classification of the Index Sets of Low[n]~p and High [n]~p[J]. Journal of Computer Science and Technology, 1991, 6(3): 285-290.

Citation:

Sui Yuefei. Classification of the Index Sets of Low[n]~p and High [n]~p[J]. Journal of Computer Science and Technology, 1991, 6(3): 285-290.

Abstract

In this paper we will first give the characterization of the p~-low p~-degree,and prove that a p.r.e. degree(?)contains a p~-speedable set A if and only if(?)′>P(?)′.Then we classify the index sets of Lown~p and Highn~p and prove that Low n~p is Σ~Pn+3-complete and High n~p is Σ~P n+4-complete.

FullText(HTML)

Export File