logic-foundations / Computability theory; degrees of unsolvability

Rigidity of the Turing degrees: is every automorphism of the Turing degrees the identity?

Theorem 1.1: every order automorphism of (DT,≤T)(\mathcal D_T,\le_T) is the identity. The proof represents an arbitrary automorphism by an arithmetic, hence Borel, map on reals (Slaman-Woodin), recovers any irrational from four values of such a map at rational affine combinations of it and two auxiliary reals, for a comeager set of auxiliary pairs, and removes the auxiliaries by Sacks-type category cone avoidance. As a corollary it settles the Slaman-Woodin biinterpretability conjecture positively. It does not address rigidity of other degree structures such as the computably enumerable degrees or the degrees below 0′\mathbf 0'.

50Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

logic-foundationsSep 24, 2026Significance 50/100Registry: lean checked

Rigidity of the Turing degrees: is every automorphism of the Turing degrees the identity?

Prior state unknown→proved

Theorem 1.1: every order automorphism of (DT,≤T)(\mathcal D_T,\le_T) is the identity. The proof represents an arbitrary automorphism by an arithmetic, hence Borel, map on reals (Slaman-Woodin), recovers any irrational from four values of such a map at rational affine combinations of it and two auxiliary reals, for a comeager set of auxiliary pairs, and removes the auxiliaries by Sacks-type category cone avoidance. As a c…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: every order automorphism of (DT,≤T)(\mathcal D_T,\le_T) is the identity. The proof represents an arbitrary automorphism by an arithmetic, hence Borel, map on reals (Slaman-Woodin), recovers any irrational from four values of such a map at rational affine combinations of it and two auxiliary reals, for a comeager set of auxiliary pairs, and removes the auxiliaries by Sacks-type category cone avoidance. As a corollary it settles the Slaman-Woodin biinterpretability conjecture positively. It does not address rigidity of other degree structures such as the computably enumerable degrees or the degrees below 0′\mathbf 0'.

Theorem 1.1: every order automorphism of (DT,≤T)(\mathcal D_T,\le_T) is the identity. The proof represents an arbitrary automorphism by an arithmetic, hence Borel, map on reals (Slaman-Woodin), recovers any irrational from four values of such a map at rational affine combinations of it and two auxiliary reals, for a comeager set of auxiliary pairs, and removes the auxiliaries by Sacks-type category cone avoidance. As a corollary it settles the Slaman-Woodin biinterpretability conjecture positively. It does not address rigidity of other degree structures such as the computably enumerable degrees or the degrees below 0′\mathbf 0'.

Recorded attempts

Evidence graph

Connected research record