Cone rigidity of the Turing degrees
Source: github.com/bjoernkjoshanssen/tt-auto/tree/0d8119a280fa466a6…
No principal upper cone above a noncomputable Turing degree is order-isomorphic to the partially ordered set of all Turing degrees. The formalization adapts degree-coding, persistence, forcing, and generic representation arguments to a hypothetical cone isomorphism, and uses a Baire-category argument to rule out a nonzero cone base. No regularity assumption is imposed on the isomorphism.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-09-000019
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000019/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000019/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'