There is no fat orbit

DOI10.1016/0168-0072(96)83748-1zbMath0858.03043OpenAlexW1992701385MaRDI QIDQ1923566

Rodney G. Downey

Publication date: 17 March 1997

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

Full work available at URL: https://doi.org/10.1016/0168-0072(96)83748-1

zbMATH Keywords

automorphismorbitslattice of recursively enumerable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (5)

The Complexity of Orbits of Computably Enumerable Sets ⋮ Friedberg splittings of recursively enumerable sets ⋮ Definable properties of the computably enumerable sets ⋮ Some orbits for \({\mathcal E}\) ⋮ Definable Encodings in the Computably Enumerable Sets

Cites Work

• Unnamed Item
• Unnamed Item
• A non-inversion theorem for the jump operator
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Definable properties of the computably enumerable sets
• Minimal pairs in initial segments of the recursively enumerable degrees
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• A jump class of noncappable degrees
• Variations on promptly simple sets
• Jumps of Hemimaximal Sets
• Post's program and incomplete recursively enumerable sets.
• Highness and bounding minimal pairs
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: There is no fat orbit