论文部分内容阅读
A polynomially exponential time restrained analytical hierarchy is introduced with the basic properties of the hierarchy followed.And it will be shown that there is a recursive set A such that A does notbelong to any level of the p-arithmetical hierarchies.Then we shall prove that there are recursive setsA and B such that the different levels of the analytical hierarchy relative to A are different and forsome n every level higher than n of the analytical hierarchy relative to B is the same as the n-th level.And whether the higher levels are collapsed into some lower level is neither provable nor disprovable inset theory and several other results.
A polynomially exponential time restrained analytical hierarchy is introduced with the basic properties of the hierarchy followed. And it it be shown that there is a recursive set A such that A does notbelong to any level of the p-arithmetical hierarchies. If we shall prove that there are recursive sets A and B such that the different levels of the analytical hierarchy relative to A are different and forsome n every level higher than n of the analytical hierarchy relative to B is the same as the n-th level .And whether the higher levels are collapsed into some lower levels is neither pro pro or disprovable inset theory and several other results.