 Proposition 3.12: The set \(T\) of indices to well-founded computable trees is \(m\)-complete for the \(\Pi^1_1\)-definable sets—i.e., \(T \in \Pi^1_1\) and for all \(A \in \Pi^1_1\), \(A \leq_m T\).