Author:
Cholak Peter A.,Downey Rodney,Harrington Leo A.
Abstract
AbstractThe goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, ε, such that the question of membership in this orbit is complete. This result and proof have a number of nice corollaries: the Scott rank of ε is + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of ε; for all finite α ≥ 9, there is a properly orbit (from the proof).
Publisher
Cambridge University Press (CUP)
Reference39 articles.
1. Harrington Leo and Soare Robert I. , Definability, automorphisms, and dynamic properties of computably enumerable sets, this Bulletin, vol. 2 (1996), no. 2, pp. 199–213.
2. The translation theorem
3. On the unsolvability of the problem of reducibility in the theory of algorithms;Muchnik;Doklady Akademii Nauk SSSR,1956
4. ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
5. Post's program and incomplete recursively enumerable sets.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献