论文信息 - On the Universal Splitting Property

On the Universal Splitting Property

We prove that if an incomplete computably enumerable set has the the universal splitting property then it is low2. This solves a question from Ambos-Spies and Fejer [1] and Downey and Stob [7]. Some technical improvements are discussed.

Rodney G. Downey

[1] Rodney G. Downey. The degrees of r.e. sets without the universal splitting property , 1985 .

[2] R. Soare. Automorphisms of the lattice of recursively enumerable sets , 1974 .

[3] P. Odifreddi. Classical recursion theory , 1989 .

[4] G. Sacks. ON THE DEGREES LESS THAN 0 , 1963 .

[5] Jeffrey B. Remmel,et al. The universal splitting property. II , 1984, Journal of Symbolic Logic.

[6] R. Soare,et al. Post's program and incomplete recursively enumerable sets. , 1991, Proceedings of the National Academy of Sciences of the United States of America.

[7] Carl G. Jockusch,et al. Relationships between reducibilities , 1969 .

[8] Rodney G. Downey. Subsets of hypersimple sets. , 1987 .

[9] Klaus Ambos-Spies,et al. Degree Theoretical Splitting Properties of Recursively Enumerable Sets , 1988, J. Symb. Log..

[10] Richard E. Ladner,et al. The weak truth table degrees of recursively enumerable sets , 1975 .

[11] Michael Stob. Index Sets and Degrees of Unsolvability , 1982, J. Symb. Log..

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

[13] Michael Stob,et al. Splitting Theorems in Recursion Theory , 1993, Ann. Pure Appl. Logic.

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