On orbits, of prompt and low computably enumerable sets
From MaRDI portal
Publication:3149988
DOI10.2178/jsl/1190150103zbMath1011.03032MaRDI QIDQ3149988
Publication date: 29 May 2003
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1190150103
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Cites Work
- Unnamed Item
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- The dense simple sets are orbit complete with respect to the simple sets
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Post's program and incomplete recursively enumerable sets.
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
- Recursively enumerable sets of positive integers and their decision problems