The dense simple sets are orbit complete with respect to the simple sets

DOI10.1016/S0168-0072(97)00065-1zbMath0924.03078OpenAlexW1974073829MaRDI QIDQ1295401

Peter A. Cholak

Publication date: 8 November 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(97)00065-1

zbMATH Keywords

automorphismcomputably enumerable setsdense simple setsorbit complete

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Definable properties of the computably enumerable sets ⋮ On orbits, of prompt and low computably enumerable sets

Cites Work

• On the Cantor-Bendixon rank of recursively enumerable sets
• Recursively enumerable sets and degrees
• Automorphisms of the lattice of recursively enumerable sets
• The Δ₃⁰-automorphism method and noninvariant classes of degrees