论文信息 - There is No Fat Orbit

There is No Fat Orbit

Abstract We give a proof of a theorem of Harrington that there is no orbit of the lattice of recursively enumerable sets containing elements of each nonzero recursively enumerable degree. We also establish some degree theoretical extensions.

Rodney G. Downey | Leo Harrington | R. Downey | L. Harrington

[1] Richard A. Shore,et al. A non-inversion theorem for the jump operator , 1988, Ann. Pure Appl. Log..

[2] Wolfgang Maass. Variations on Promptly Simple Sets , 1985, J. Symb. Log..

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

[4] Michael Stob,et al. Minimal pairs in initial segments of the recursively enumerable degrees , 1997 .

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

[6] S. Barry Cooper,et al. A jump class of noncappable degrees , 1989, Journal of Symbolic Logic.

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

[8] Michael Stob,et al. Relative Recursive Enumerability , 1982 .

[9] Rodney G. Downey,et al. Jumps of Hemimaximal Sets , 1991, Math. Log. Q..

[10] Rodney G. Downey,et al. Highness and Bounding Minimal Pairs , 1993, Math. Log. Q..

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

[12] Michael Stob,et al. Automorphisms of the lattice of recursively enumerable sets: Orbits , 1992 .

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