论文信息 - Array nonrecursive sets and multiple permitting arguments

Array nonrecursive sets and multiple permitting arguments

We study a class of permitting arguments in which each positive requirement needs multiple permissions to succeed. Three natural examples of such constructions are given. We introduce a class of r. e. sets, the array nonrecursive sets, which consists of precisely those sets which allow enough permission for these constructions be performed. We classify the degrees of array nonrecursive sets and so classify the degrees in which each of these constructions can be performed.

[1] Robert I. Soare,et al. An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees , 1984 .

[2] Antonín Kucera,et al. An Alternative, Priority-Free, Solution to Post's Problem , 1996, MFCS.

[3] R. Soare. Recursively enumerable sets and degrees , 1987 .

[4] C. Jockusch. Semirecursive sets and positive reducibility , 1968 .

[5] S. Barry Cooper. Minimal Pairs and High Recursively Enumerable Degrees , 1974, J. Symb. Log..

[6] R. Downey,et al. T-degrees, jump classes, and strong reducibilities , 1987 .

[7] Donald A. Martin,et al. Classes of Recursively Enumerable Sets and Degrees of Unsolvability , 1966 .

[8] Robert W. Robinson,et al. Simplicity of recursively enumerable sets , 1967, Journal of Symbolic Logic.

[9] R. Soare,et al. Π⁰₁ classes and degrees of theories , 1972 .

[10] Alistair H. Lachlan. Embedding nondistributive lattices in the recursively enumerable degrees , 1972 .

[11] Donald A. Martin,et al. Axiomatizable Theories with Few Axiomatizable Extensions , 1970, J. Symb. Log..

[12] C. Jockusch. Degrees in Which the Recursive Sets are Uniformly Recursive , 1972, Canadian Journal of Mathematics.

[13] Michael Stob,et al. Splitting properties and jump classes , 1981 .