We prove the following theorem: Given a⊆ω and $1\le \alpha <{\omega }_1^{CK}$, if for some $\eta <{\aleph }_1$ and all u ∈ WO of length η, a is ${\Sigma }_{\alpha }^0\left(u\right)$, then a is ${\Sigma }_{\alpha }^0$.We use this result to give a new, forcing-free, proof of Leo Harrington’s theorem: ${\Sigma }_1^1$-Turing-determinacy implies the existence of $0^{}$.

A constructively valid counterpart to Bourbaki’s Fixpoint Lemma for chain-complete partially ordered sets is presented to obtain a condition for one closure system in a complete lattice $L$ to be stable under another closure operator of $L$. This is then used to deal with coproducts and other aspects of frames.