{"id":"palomar/PALOMAR-2026-11-09-000019","url":"https://github.com/bjoernkjoshanssen/tt-auto/tree/0d8119a280fa466a6b4ed35f0940a8a526c751d9","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-09-000019-v1.json","repo":"https://github.com/bjoernkjoshanssen/tt-auto","tags":["math.LO","msc:03D28","msc:03B35"],"score":0,"title":"Cone rigidity of the Turing degrees","trust":"high","domain":"math.LO","source":"palomar","authors":["Bjørn Kjos-Hanssen"],"reviews":0,"subject":"math.LO","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-09","reactions":{},"formalized":true}