Computably enumerable sets that are automorphic to low sets (Q2964278): Difference between revisions

@@ Property / cites work @@
+Automorphisms of the lattice of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
+Normal rank
@@ Property / cites work @@
+ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
@@ Property / cites work: ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS / rank @@
+Normal rank
@@ Property / cites work @@
+The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$
+Normal rank
@@ Property / cites work @@
+Definable properties of the computably enumerable sets
+Normal rank
@@ Property / cites work @@
+The Δ₃⁰-automorphism method and noninvariant classes of degrees
+Normal rank
@@ Property / cites work @@
+Degrees of recursively enumerable sets which have no maximal supersets
+Normal rank
@@ Property / cites work @@
+Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
+Normal rank
@@ Property / cites work @@
+Orbits of computably enumerable sets: Low sets can avoid an upper cone
+Normal rank
@@ Property / cites work @@
+Degrees of classes of RE sets
@@ Property / cites work: Degrees of classes of RE sets / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
+Normal rank
@@ Property / cites work @@
+Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
+Normal rank