论文信息 - Cappable recursively enumerable degrees and Post's program

Cappable recursively enumerable degrees and Post's program

We give a simple structural property which characterizes the r.e. sets whose (Turing) degrees are cappable. Since cappable degrees are incomplete, this may be viewed as a solution of Post's program, which asks for a simple structural property of nonrecursive r.e. sets which ensures incompleteness.

André Nies | Klaus Ambos-Spies

[1] R. Soare. Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets , 1974 .

[2] S. S. Marchenkov. One class of partial sets , 1976 .

[3] Emil L. Post. Recursively enumerable sets of positive integers and their decision problems , 1944 .

[4] Michael Stob,et al. Structural interactions of the recursively enumerable T- and W-degrees , 1986, Ann. Pure Appl. Log..

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

[6] 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 .

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

[8] 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.

[9] Robert I. Soare,et al. Computational complexity, speedable and levelable sets , 1977, Journal of Symbolic Logic.

[10] Alistair H. Lachlan,et al. Lower Bounds for Pairs of Recursively Enumerable Degrees , 1966 .

[11] C. E. M. Yates. A Minimal Pair of Recursively Enumerable Degrees , 1966, J. Symb. Log..

[12] Klaus Ambos-Spies,et al. Cupping and noncapping in the r.e. weak truth table and turing degrees , 1985, Arch. Math. Log..

[13] C. E. M. Yates,et al. Three theorems on the degrees of recursively enumerable sets , 1965 .