Cone rigidity of the Turing degrees

Two sets of natural numbers have the same Turing degree if each can be computed with access to the other. The upper cone above a degree contains that degree and all degrees that can compute it. Can the order on a proper upper cone be a copy of the entire order of Turing degrees?

Why it matters and what counts as progress

Why it matters: An order can have no nontrivial symmetries and still contain a smaller copy of itself. Cone rigidity asks whether the order of relative computability has such a copy above a noncomputable degree.

What counts as progress: Rule out an order isomorphism onto every proper principal cone or construct one. Track any assumptions on the isomorphism and whether the proof applies to all Turing degrees.

How the problem developed

  1. 2005 · Definability and persistence [4]

    Theodore A. Slaman and W. Hugh Woodin Developed methods that the cone proof adapts to source and target orders with different least elements.

  2. 9 Nov 2026 · No proper cone isomorphic to the full order [1][3]

    Bjørn Kjos-Hanssen with ChatGPT 6 Pro Reported and checked the result for ordinary Turing degrees with no regularity assumption on the isomorphism.

  3. 11 Nov 2026 · Pairwise rigidity [6][7]

    Bjørn Kjos-Hanssen with ChatGPT 6 Pro Strengthened the original cone theorem to pairwise non-isomorphism of cones with different bases and pointwise rigidity of every cone isomorphism.

AI contribution

Sources

  1. Kjos-Hanssen’s mathematical account of cone rigidity
  2. Project attribution and checking scope
  3. Cone rigidity verification workflow
  4. Slaman and Woodin, Definability in Degree Structures
  5. OpenAI’s degree-rigidity development
  6. Kjos-Hanssen’s two-cone argument and provenance
  7. Completed two-cone Comparator workflow
Publication history