Rigidity of the Turing degrees
Every order automorphism of the full partial order of Turing degrees (D_T, \leq_T) is the identity: \forall \pi \in \mathrm{Aut}(\mathcal{D}_T, \leq_T)\ \forall \mathbf{a} \in \mathcal{D}_T\ \pi(\mathbf{a}) = \mathbf{a}, working in ZFC with no definability or regularity hypothesis on \pi.
The proof is complete and rigorous, deriving the full rigidity theorem from the cited Slaman-Woodin representation theorem (Theorem 3.1) via self-contained computability and Baire category arguments.
“Theorem 1.1. Every order automorphism of the full Turing-degree structure is the identity: \forall \pi \in \mathrm{Aut}(\mathcal{D}_T, \leq_T)\ \forall \mathbf{a} \in \mathcal{D}_T\ \pi(\mathbf{a}) = \mathbf{a}.” · Show in paper