The extent of constructive game labellings
Benedikt Löwe, Brian Semmes

Abstract:
We develop a theory of labellings for infinite trees, define the notion
of a combinatorial labelling, and show that \Delta^0_2 is the largest
boldface pointclass in which every set admits a combinatorial labelling.

Keywords: Constructive Determinacy Proof