What was already known
Slaman and Woodin developed persistence and coding methods for degree structures. OpenAI’s later formal development addresses order automorphisms of the full Turing-degree order.
This revision has no four-dimension assessment. Read the criteria.
AI involvement
Bjørn Kjos-Hanssen directed the cone-specific work with ChatGPT 6 Pro. The project credits the model for that development and identifies the earlier OpenAI library it builds on.
Importance
The theorem rules out copies of the full order in any proper principal upper cone. The proof adapts degree-rigidity methods to orders with different least elements.
Technical verification
Formal checking
The pinned workflow passed for the comparison between the concrete statement and the proof. The repository reports Lean, NanoDa and con-ron checks.
- Checker
- Lean, NanoDa and con-ron through the project’s Comparator workflow
- Scope
- For every nonzero Turing degree, the principal upper cone above it is not order-isomorphic to the full partial order of ordinary Turing degrees.
- Basis
- Reported by the linked checker
Other useful sources
Correction and publication history
The two-cone theorem strengthens the previously published result.
Read this published revisionNew curated research with documented central AI work.
Read this published revision