Orbits of computably enumerable sets: Low sets can avoid an upper cone

DOI10.1016/S0168-0072(01)00119-1MaRDI QIDQ1849863zbMATH OpenFDO

Authors Russell Miller

Publication date 2 December 2002

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(01)00119-1

zbMATH Keywords

computably enumerable degreeslattice automorphismslow computably enumerable setorbitupper cone

Mathematics Subject Classification ID

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

Review text

The author investigates the orbit of a low computably enumerable (c.e.) set under automorphisms of the partial order \({\mathcal E}\) of c.e. sets under inclusion, and it is proved that: For every low c.e. set \(A\) and every noncomputable c.e. set \(C\), there exists an automorphism of \({\mathcal E}\) mapping \(A\) to a set \(B\) such that \(C\nleqslant_TB\). Thus, the orbit of \(A\) cannot be contained in the upper cone above \(C\).

Recommendations

• On orbits, of prompt and low computably enumerable sets
• On the orbits of computably enumerable sets
• The computably enumerable sets: recent results and future directions
• Computably enumerable sets that are automorphic to low sets
• Extension theorems, orbits, and automorphisms of the computably enumerable sets

Cites work

• 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
• Definable properties of the computably enumerable sets
• Friedberg splittings of recursively enumerable sets
• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1531936 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Jumps of Hemimaximal Sets
• On orbits, of prompt and low computably enumerable sets
• Post's program and incomplete recursively enumerable sets.
• Some orbits for \({\mathcal E}\)
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• The Δ₃⁰-automorphism method and noninvariant classes of degrees
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

Cited in

(1)

• Computably enumerable sets that are automorphic to low sets

This page was built for publication: Orbits of computably enumerable sets: Low sets can avoid an upper cone

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