Automorphisms of the lattice of recursively enumerable sets: promptly simple sets-Reference-Cited by-同舟云学术

Automorphisms of the lattice of recursively enumerable sets: promptly simple sets

Published:1992 Issue:2 Volume:332 Page:555-570
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Cholak P.,Downey R.,Stob M.

Abstract

We show that for every coinfinite r.e. set A A there is a complete r.e. set B B such that L ∗ ( A ) ≈ eff L ∗ ( B ) {\mathcal {L}^{\ast } }(A){ \approx _{{\text {eff}}}}{\mathcal {L}^{\ast } }(B) and that every promptly simple set is automorphic (in E ∗ {\mathcal {E}^{\ast } } ) to a complete set.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1992-332-02/S0002-9947-1992-1097164-6/S0002-9947-1992-1097164-6.pdf

Reference18 articles.

1. P. Cholak, Automorphisms of the lattice of recursively enumerable sets (in preparation).

2. \bysame, Automorphisms of the lattice of recursively enumerable sets, Ph.D. Dissertation, Univ. of Wisconsin, 1991.

3. Retraceable sets;Dekker, J. C. E.;Canadian J. Math.,1958

4. Automorphisms of the lattice of recursively enumerable sets: orbits;Downey, R. G.;Adv. Math.,1992

5. Post’s program and incomplete recursively enumerable sets;Harrington, Leo;Proc. Nat. Acad. Sci. U.S.A.,1991

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lowness properties for strong reducibilities and the computational power of maximal sets;Computability;2023-10-02

2. Definable relations in Turing degree structures;Journal of Logic and Computation;2013-09-18

3. On n-tardy sets;Annals of Pure and Applied Logic;2012-09

4. The Complexity of Orbits of Computably Enumerable Sets;Bulletin of Symbolic Logic;2008-03

5. Orbits of computably enumerable sets: low sets can avoid an upper cone;Annals of Pure and Applied Logic;2002-12