Some orbits for E

DOI10.1016/S0168-0072(00)00060-9MaRDI QIDQ1840464zbMATH OpenFDO

Authors Eberhard Herrmann, Peter A. Cholak, Rodney G. Downey

Publication date 30 September 2001

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

Full work available at URL https://doi.org/10.1016/S0168-0072(00)00060-9

zbMATH Keywords

automorphismcomputably enumerabledefinablemaximalorbits

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Review text

The reviewed paper contains a description of some new orbits in the lattice of computably enumerable sets modulo different equivalence relations, extending the collection of the known orbits. It seems that all of the content of the paper is a proof of several conjectures raised by the third author in 1989 in a private communication to the first two authors.

Recommendations

• On the orbits of computably enumerable sets
• The Complexity of Orbits of Computably Enumerable Sets
• scientific article; zbMATH DE number 4160702
• Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets
• There is no fat orbit

Cites work

• A jump class of noncappable degrees
• A non-inversion theorem for the jump operator
• Automorphisms of the lattice of recursively enumerable sets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Classical recursion theory. Vol. II
• Codable sets and orbits of computably enumerable sets
• Diagonals and -maximal sets
• Diagonals and semihyperhypersimple sets
• scientific article; zbMATH DE number 4033723 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Jumps of Hemimaximal Sets
• Minimal 1-degrees and truth-table reducibility
• Minimal pairs and high recursively enumerable degrees
• Post's program and incomplete recursively enumerable sets.
• Recursion, metarecursion, and inclusion
• Recursively enumerable generic sets
• Splitting theorems in recursion theory
• The translation theorem
• The Δ₃⁰-automorphism method and noninvariant classes of degrees
• There is no fat orbit

Cited in

(9)

• Orbits of computably enumerable sets: Low sets can avoid an upper cone
• \(\mathcal{D}\)-maximal sets
• On splits of computably enumerable sets
• On the orbits of computably enumerable sets
• Orbits in strips
• Equivalence of set- and bag-valued orbits
• scientific article; zbMATH DE number 472833 (Why is no real title available?)
• The Complexity of Orbits of Computably Enumerable Sets
• Extension theorems, orbits, and automorphisms of the computably enumerable sets

This page was built for publication: Some orbits for \({\mathcal E}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1840464)