A minimal upper bound on a sequence of Turing degrees which represents that sequence (Q798318)

Fix a recursive pairing function \((x,y)\mapsto <x,y>\); \((f)_ x(y)=f(<x,y>)\). Let I be a set of Turing degrees and \(f\in^{\omega}\omega\). f represents I iff \(I=\{\deg ((f)_ n)| n<\omega\}.\) A degree \({\mathfrak a}\) represents I iff some \(f\in {\mathfrak a}\) does so. Theorem. Suppose \(I=\{{\mathfrak a}_ i|\quad i<\omega\}\) is a sequence of Turing degrees, and for all i, \({\mathfrak a}_ i<{\mathfrak a}_{i+1}\). Then some minimal upper bound on I represents I. - Some open problems are presented.