Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
From MaRDI portal
Publication:3041174
DOI10.1016/0003-4843(82)90016-XzbMath0526.03022MaRDI QIDQ3041174
Publication date: 1982
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
automorphismslattice of recursively enumerable setslow setssemilattice of recursively enumerable degrees
Related Items (21)
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees ⋮ Variations on promptly simple sets ⋮ Nonbounding and Slaman triples ⋮ Computably enumerable sets that are automorphic to low sets ⋮ Splitting properties and jump classes ⋮ Isomorphism of lattices of recursively enumerable sets ⋮ Atomless \(r\)-maximal sets ⋮ On strongly jump traceable reals ⋮ The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ ⋮ Countable thin \(\Pi^0_1\) classes ⋮ Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets ⋮ \(r\)-maximal major subsets ⋮ Some lowness properties and computational complexity sequences ⋮ Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures ⋮ Definable properties of the computably enumerable sets ⋮ The intervals of the lattice of recursively enumerable sets determined by major subsets ⋮ ON SUPERSETS OF NON-LOW SETS ⋮ Splitting theorems in recursion theory ⋮ Degrees of orderings not isomorphic to recursive linear orderings ⋮ Congruence relations on lattices of recursively enumerable sets ⋮ On orbits, of prompt and low computably enumerable sets
This page was built for publication: Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
