Computably enumerable sets that are automorphic to low sets
From MaRDI portal
Publication:2964278
DOI10.3233/COM-160053zbMath1420.03090arXiv1510.04199OpenAlexW2963233618MaRDI QIDQ2964278
Rachel Epstein, Peter A. Cholak
Publication date: 23 February 2017
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.04199
Cites Work
- Definable properties of the computably enumerable sets
- Orbits of computably enumerable sets: Low sets can avoid an upper cone
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Degrees of classes of RE sets
- Automorphisms of the lattice of recursively enumerable sets
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
- Degrees of recursively enumerable sets which have no maximal supersets
- The Δ₃⁰-automorphism method and noninvariant classes of degrees